def solve():
n = int(input())
a = list(map(int, input().split()))
s = [0]*(n+1)
for i in range(n):
s[i+1] = s[i] + a[i]
ans = max(s) - min(s)
print(ans)
t = int(input())
for i in range(t):
solve()#include <bits/stdc++.h>
#define mod (int) 1000000007
#define MAX (int) 1e6+1
#define all(x) x.begin(),x.end()
#define pr pair<int,int>
typedef long long int ll;
using namespace std;
ll n,m,k,x,ans=INT_MAX;
void solve(){
cin>>n;
vector<int> v(n);
for(int &i:v) cin>>i;
ll max_ele=0,min_ele=0;
ll pre=0;
for(int i:v){
pre+=i;
max_ele=max(max_ele,pre);
min_ele=min(min_ele,pre);
}
cout<<(max_ele-min_ele)<<endl;
}
int main(){
int t=1;
cin>>t;
//trv();
while(t--) solve();
return 0;
}
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |