Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define int long long
- using namespace std;
- int s3 = 0;
- void cmp(int n){
- s3 += n;
- }
- void solve(){
- int n;
- cin >> n;
- vector<int> v(n);
- vector<vector<int>> d(2, vector<int>(n));
- for(int i = 0; i < n; ++i){
- cin >> v[i];
- }
- int s1 = 0, s2 = 0;
- int mn = 1e9, place = 0;
- int temp = 0;
- for(int i = 0 ; i < n; ++i){
- if(i == n - 1){
- s1 = abs(s1 + v[i]);
- }
- else{
- s1 += v[i];
- }
- s2 = abs(s2 + v[i]);
- temp += v[i];
- if(temp < mn){
- mn = temp;
- place = i;
- }
- }
- s3 = -mn;
- ++place;
- for_each(v.begin() + place, v.end(), cmp);
- int ans = max(s1, max(s2, s3));
- cout << ans << '\n';
- }
- signed main() {
- ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
- int t;
- cin >> t;
- while(t--){
- solve();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement