Submission #522904

#TimeUsernameProblemLanguageResultExecution timeMemory
522904snpmrnhlolBigger segments (IZhO19_segments)C++14
0 / 100
1 ms204 KiB
#include <iostream> using namespace std; int v[500000]; int main() { long long n,s = 0,s2 = 0,bp,cnt = 1,i,psum = -1e18;; cin>>n; for(i = 0;i < n;i++){ cin>>v[i]; } s = v[0]; bp = 1; for(i = 1;i < n;i++){ s2+=v[i]; if(s <= s2){ while(s <= s2 && psum <= s){ s+=v[bp]; s2-=v[bp]; bp++; } cnt++; bp--; s-=v[bp]; s2+=v[bp]; psum = s; s = s2; bp = i + 1; s2 = 0; } } cout<<cnt; 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...