This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
long long red[500005],sum[500005];
pair<long long,long long>ans[500005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin>>n>>red[0];
sum[0]=red[0];
for(int i=1;i<n;i++){
cin>>red[i];
sum[i]=sum[i-1]+red[i];
}
ans[0]={1,red[0]};
for(int i=1;i<n;i++){
ans[i]={ans[i-1].first,ans[i-1].second+red[i]};
for(int j=i-1;j>=0 && ans[i].first-ans[j].first<2;j--){
if(ans[i].first-ans[j].first==0){
if(ans[j].second<=sum[i]-sum[j]){
ans[i]={ans[j].first+1,sum[i]-sum[j]};
break;
}
}else{
if(ans[j].second<=sum[i]-sum[j] && sum[i]-sum[j]<ans[i].second){
ans[i]={ans[j].first+1,sum[i]-sum[j]};
break;
}
}
}
}
cout<<ans[n-1].first<<endl;
return 0;
}
# | 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... |