Submission #333644

#TimeUsernameProblemLanguageResultExecution timeMemory
333644DovranBigger segments (IZhO19_segments)C++11
0 / 100
1 ms364 KiB
#include <bits/stdc++.h> #define N 500009 #define pii pair <int, int> #define ff first #define sz() size() #define ss second #define pb push_back #define ll long long using namespace std; int n, v[N]; int main(){ cin>>n; for(int i=0; i<n; i++) cin>>v[i]; ll x=v[0], ans=1, y=0, l=2; for(int i=1; i<n; i++){ y+=v[i]; if(y>=x){ while(x+v[l]<=y-v[l]) y-=v[l], l++; ans++, x=y, y=0; } } cout<<ans<<' '; }
#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...