# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598038 | Summers | Divide and conquer (IZhO14_divide) | C++14 | 33 ms | 6360 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 endl '\n'
using namespace std;
long long a[200000], b[200000], c[200000], d[200000];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,n,le,ri,mid,ans=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i]>>b[i]>>c[i];
b[i]+=b[i-1];
c[i]+=c[i-1];
d[i]=min(d[i-1], c[i-1]-a[i]);
}
for(i=1;i<=n;i++)
{
le=1; ri=i;
while(le<=ri)
{
mid=(le+ri)/2;
if(d[mid]<=c[i]-a[i])ri=mid-1;
else le=mid+1;
}
ans=max(ans, b[i]-b[le-1]);
}
cout<<ans<<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... |