#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define LSB(i) ((i) & (-i))
#define ll long long
const int dx[]{-1,1,0,0,-1,-1,1,1};
const int dy[]{0,0,1,-1,-1,1,-1,1};
const int MOD = 1e9+7;
const int inf = 1e9+1; 


#define int ll

const int N = 1e6+1;
int dp[N][2], A[N];
int n;

void solve(int testCase)  {
     memset(dp, 0, sizeof dp);
     cin >> n;
    for(int i = 1; i <= n; ++i) cin >> A[i];
    for(int i = 1; i <= n; ++i){
        dp[i][0] = max(dp[i-1][0]+A[i], A[i]);
        if(i > 1) dp[i][1] = dp[i-1][0] + A[i];
    }
    int ans = -1e18;
    for(int i = 1; i <= n; ++i) ans = max(ans, dp[i][0]);
    cout << ans << '\n';
}   

int32_t main(){
    fastio();  
    int t = 1;
    cin >> t;
    for(int i = 1; i <= t; ++i){
        solve(i);
    }
    return 0;
}