# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336340 | beksultan04 | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 492 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 int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 5e5+12,INF=1e9+7;
int q[N],ans,n,s[N],a[N];
pii ss[N];
main(){
int i,j;
scan1(n)
for (i=1;i<=n;++i){
scan1(q[i])
s[i]=s[i-1]+q[i];
ss[i].fr=s[i];
ss[i].sc = i+1;
a[i]++;
}
bool f=1;
while (f){
f=0;
for (i=1;i<=n;++i){
int sum=0;
for (j=ss[i].sc;j<=n;++j){
sum+=q[j];
if (sum >= ss[i].fr){
a[i]++;
ss[i].fr=sum;
ss[i].sc=j+1;
f=1;
break;
}
}
}
}
for (i=1;i<=n;++i){
ans=max(ans,a[i]);
}
cout <<ans;
}
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... |