-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path369-remove-the-ends.cpp
More file actions
41 lines (40 loc) · 1020 Bytes
/
Copy path369-remove-the-ends.cpp
File metadata and controls
41 lines (40 loc) · 1020 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
/*
* Remove the Ends [2064C]
* Problem: https://codeforces.com/problemset/problem/2064/C
* Verdict: ACCEPTED Solved: 2025-04-29
* Language: C++23 (GCC 14-64, msys2)
* Runtime: 93 ms Memory: 100 KB
* Tags: brute force, constructive algorithms, dp, greedy
* Author: BidoTeima
* Source: https://codeforces.com/contest/2064/submission/317752247
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
ll suff[n];
for(auto&i:a)cin>>i;
suff[n-1]=(a[n-1]<0?-a[n-1]:0);
for(int i = n - 2; i >= 0; i--){
suff[i]=suff[i+1];
if(a[i]<0)suff[i]-=a[i];
}
ll sum = 0, ans = 0;
for(int i = 0; i < n; i++){
if(a[i]>0)sum += a[i];
ans=max(ans,sum+suff[i]);
}
cout << ans << '\n';
}
return 0;
}