| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 376501 | jamielim | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 364 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;
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
typedef pair<ll,ll> pll;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;
int n;
int arr[500005];
int ans[500005];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",&arr[i]);
queue<ii> q;
ans[0]=1;
q.push(mp(arr[0],0)); // last segment sum, index
ll pref=arr[0];
int lst=0;
for(int i=1;i<n;i++){
pref+=arr[i];
while(!q.empty()&&q.front().fi<=pref-arr[q.front().se]){
pref-=arr[q.front().se];
lst=ans[q.front().se];
//printf("pop %d\n",q.front().se);
q.pop();
}
ans[i]=lst+1;
q.push(mp(pref,i));
//printf("%d\n",ans[i]);
}
printf("%d",ans[n-1]);
}
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... | ||||
