using System;
namespace Codechef__TLG_ 
{
    class Program 
    {

This is more optimum than the easy solution. In this solution, I don't have to calculate the cumulative sum for both players. I am just calculating the cumulative difference that is lead. If diff is positive p1 wins else p2 wins. Max lead will be the max |diff|.

#include <iostream>

#include<iostream>

using namespace std;

int main()

This problem is a non-trivial usage of a Segment Tree.

This is a classic and "Must Do" problem on the subject.

I don't think Kadane's can get AC.

There are many tutorials on the internet about this ...

i am trying to use kadane's algorithm on each segment of BIT but getting WA, can someone help?

This program works fine on my system but the website gives error: "Grading Failure due to Network Outage; Please Resubmit in a Bit"

I've tried resubmitting but it keeps on giving this error

seq,n = input().split()

I got it cooler!

#include <iostream>
 
using namespace std;

Here's the c++11 solution for beginners like me

#include <iostream>
#include <string>
 

Sorting using end time.

#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long 

So most of the people used lower_bound. But I thought of using custom binary search function for clear understanding. Here you go:-

#include<bits/stdc++.h>

need help with my code....O(n^2)..complexity but I'm getting TLE

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

I have implemented something similar to your stack solution and think it is O(n).I am not using sorting. Can you confirm-Solution: 25550837

This is an incomplete solution. You missed one form of rectangles that make up the answers. You assumed that solution rectangle will always have point(s) lying on its roof, this is not always...

I'm sorry ,but I'm unfamiliar with stacks. Can you just give a brief description of how you managed to further bring it down to O(n) please?

Thanks in advance

can someone tell me where my logic failes please ? thanks !

#include <iostream>

#include<algorithm>

using namespace std;

Mine is also failing on test case 15, did you found the problem?

My solution give output 2 as well. But still it is failing on test case 15.. :(