# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499836 | reni | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 332 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<iostream>
#define endl '\n'
using namespace std;
long long pref[1000000], ans[1000000], sum[1000000];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n,i,j, ch, pr, br=0, maxr=1, le, ri, mid;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>ch;
pref[i]=pref[i-1]+ch;
}
ans[1]=1;
sum[1]=pref[1];
for(i=2;i<=n;i++)
{
le=0;ri=i-1;
ans[i]=ans[i-1];
while(le<=ri)
{
mid=(le+ri)/2;
if(ans[mid]<ans[i] || sum[mid]<=pref[i]-pref[mid])le=mid+1;
else ri=mid-1;
}
j=le-1;
if(sum[j]<=pref[i]-pref[j])
{
if(ans[j]+1>ans[i])
{
ans[i]=ans[j]+1;
sum[i]=pref[i]-pref[j];
}
else if(ans[j]+1==ans[i])
{
ans[i]=ans[j]+1;
sum[i]=min(sum[i],pref[i]-pref[j]);
}
}
// cout<<ans[i]<<" "<<sum[i]<<endl;
}
cout<<ans[n]<<endl;
}
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... |