void solve()
{
    ll n, sum = 0;
    cin >> n;
    vector<int> v(n);
    for (auto &i : v)
    {
        cin >> i;
        sum += i;
    }
    ll l = 0, r = 0, Minn = INT_MAX, test = 0;
    while (l < n or r < n)
    {
        while (test + v[r] <= 0 and r < n)
        {
            test += v[r++];
            Minn = min(Minn, test);
        }
        r++, l = r;
        test = 0;
    }
    cout << (Minn != INT_MAX ? sum - Minn : sum) << '\n';
}