View Code of Problem 61

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>

using namespace std;

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int a[n],b[n],max=0;
        for(int i=0;i<n;i++)
            { cin>>a[i]; b[i]=a[i]; }
        for(int i=1;i<n;i++)
        {
            if(a[i-1]+b[i-1]>=b[i])
            {
                b[i]=b[i-1]+a[i-1];
                if(b[i]>max)
                    max=b[i];
            }
        }
        cout<<max<<endl;
    }
}