//In maximum sub array problem
//here is my code
#include
using namespace std;
int main()
{
int a;
cin>>a;
for(int z=0;z<a;z++)
{
int n,i,j;
cin>>n;
int a[1000];
int cs=0;
int ms=0;
for (int i=0;i<n;i++)
{
cin>>a[i];
}
//kadane’s Algorithm for maximum subarray sum
for(int i=0;i<n;i++)
{
cs=cs+a[i];
if (cs<0)
{
cs=0;
}
ms=max(cs,ms);
}
cout<<ms<<endl;
}
return 0;
}