Submission #49928855

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
#define int long long
const int mod=998244353ll;
void solve(){
    int n;cin>>n;vector<int>a(n);
    for(auto&i:a)cin>>i;
    int mi=0,add=0;
    for(int i=0;i<n;i++){
        add+=a[i];
        mi=min(mi,add);
    }
    // cout<<max(-mi,0ll);
    mi=max(-mi,0ll);
    for(int i=0;i<n;i++)mi+=a[i];
    cout<<mi;
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
#define int long long
const int mod=998244353ll;

void solve(){
    int n;cin>>n;vector<int>a(n);
    for(auto&i:a)cin>>i;
    int mi=0,add=0;
    for(int i=0;i<n;i++){
        add+=a[i];
        mi=min(mi,add);
    }
    // cout<<max(-mi,0ll);
    mi=max(-mi,0ll);
    for(int i=0;i<n;i++)mi+=a[i];
    cout<<mi;
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    // int t;cin>>t;while(t--)
        solve();
}

Submission Info

Judge Result