t = int(input())
a,b=0,0
prevp1,prevp2 = 0,0
while(t>0):
    l = list(map(int,input().split()))

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>

import java.lang.*;

import java.util.*;

class UnderstandSomething {

// Created by ...

/* Author -Praveen Gupta*/

#pragma GCC target ("avx2")

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,...

Got it to run using set+unordered_map, but now I wanted to try out the simpler while loop.

Here's A Recursive DP Solution of this!

Equals Gifts IARCS at master · JVJplus

yes sir plz

I submitted my solution at IARCS Problem Archive. A fatal error just keeps coming up without any reason. There seems to be this error with every C++ submission on IARCS's grader.

Here's my solution for anybody who may require help:

That's awesome Rajashekar, great job. That was quick. :)

Next step is the Competitive Programming Playlist. Its long, but just take it one step at a time. Ask questions if you get...

i completed all the beginner problems posted...after these what i need to do next?

Thanks

You seemed to already know the answer XD Anyway, yeah, the problems I set will be mostly about maths. I cannot think "algorithmically" much myself :P

Please keep a mathematics problem like ISTA2001 in the coming ICO Prep Competitions. I really liked it. :)

Waiting eagerly for it bro