# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290763 | PKhing | Bigger segments (IZhO19_segments) | C++14 | 1575 ms | 2688 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>
#define ll long long
#define ii pair<ll,ll>
using namespace std;
ll tab[500005];
ll qs[500005];
ll dp[500005];
ll bf[500005];
int n;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lld",&tab[i]);
qs[i]=tab[i]+qs[i-1];
}
for(int i=1;i<=n;i++){
for(int j=0;j<i;j++){
if(qs[i]-qs[j]>=bf[j]){
if(dp[i]<dp[j]+1){
dp[i]=dp[j]+1;
bf[i] = qs[i]-qs[j];
}
else if(dp[i]==dp[j]+1){
bf[i]=min(bf[i],qs[i]-qs[j]);
}
}
}
//printf("%lld",dp[i]);
}
printf("%lld",dp[n]);
}
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... |