Submission #957179

#TimeUsernameProblemLanguageResultExecution timeMemory
957179Darren0724Bigger segments (IZhO19_segments)C++17
0 / 100
1 ms600 KiB
#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;

int32_t main() {
    LCBorz;
    int n;cin>>n;
    vector<int> v(n);
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    int last=0,j=-1,now=0,ans=0;
    for(int i=0;i<n;i++){
        now+=v[i];
        if(now>=last){
            while(j+1<n){
                if(now-v[j+1]>=last+v[j+1]){
                    j++;
                    now-=v[j];
                    last+=v[j];
                }
                else break;
            }
            ans++;
            last=now;
            now=0;
            j=i;
        }
    }
    cout<<ans<<endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...