Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- int t;
- cin>>t;
- while(t--){
- int n;
- cin>>n;
- vector<int> a(n+1);
- for(int i=1; i<=n; i++)
- cin>>a[i];
- long long int maxSum = -1e18;
- vector<long long int> prefSum(n+1);
- long long int sum = accumulate(a.begin(), a.end(), 0ll), ans=0;
- for(int i=1; i<=n; i++){
- prefSum[i] += prefSum[i-1] + a[i];
- if(i-2 >= 0) maxSum = max(maxSum, prefSum[i-2]);
- ans = min(ans, prefSum[i] - maxSum);
- }
- cout<<sum - 2*ans<<"\n";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement