/*肯定是连续子序列和，否则只需把整数相加即可*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int a[1000001];
/*int cmp(const void *a,const void *b)
{
	return *(int *)a-*(int *)b;
}*/
int subsequencesum(int a[],int n)
{
	int sum=0,maxsum=0,i;
	for(i=0;i<n;i++)
	{
		sum+=a[i];
		if(sum>maxsum)
			maxsum=sum;   
		else
			if(sum<0)
				sum=0;
	}
	return maxsum;
}
int main()
{
	int i,T;int num,max=-101;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&num);
		//memset(a,0,sizeof(a));
		for(i=0;i<num;i++)
		{
			scanf("%d",a+i);
			if(a[i]>max)/*用qsort函数会浪费大量时间,而且wa啦*/
				max=a[i];
		}
		//qsort(a,num,sizeof(int),cmp);/*全是负数的情况要特殊考虑*/
		printf("%d\n",max<=0?max:subsequencesum(a,num));
	}
	return 0;
}



//TLE,十个数就40s
#include<stdio.h>
#include<string.h>
//#include<time.h>
int a[1000001];
int subsequencesum(int a[],int n)
{
int sum,maxsum=0,i,j,k;
for(i=0;i<n;i++)
for(j=i;j<n;j++)
{
sum=0;
for(k=i;k<=j;k++)
sum+=a[k];
if(sum>maxsum)
maxsum=sum;
}
return maxsum;
}
int main()
{
	int i,j,T;int num;
	//time_t start,end;
//	start=time(NULL);
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&num);
		memset(a,0,sizeof(a));
		for(i=0;i<num;i++)
			scanf("%d",a+i);
		printf("%d\n",subsequencesum(a,num));
	}
//	end=time(NULL);
//	printf("%d\n",end-start);
	return 0;
}