# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290810 | Plurm | Bigger segments (IZhO19_segments) | C++11 | 1 ms | 256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
long long last = 0ll;
long long sum = 0ll;
int cnt = 0;
deque<int> dq;
for(int i = 1; i <= n; i++){
int x;
scanf("%d",&x);
sum += 1ll * x;
dq.push_back(x);
if(sum >= last){
while(!dq.empty() && sum-dq.front() >= last+dq.front()){
sum -= 1ll*dq.front();
last += 1ll*dq.front();
dq.pop_front();
}
last = sum;
cnt++;
sum = 0ll;
dq.clear();
}
}
printf("%d\n",cnt);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |