# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1042160 | Minbaev | Divide and conquer (IZhO14_divide) | C++17 | 21 ms | 8028 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 int long long int
using namespace std;
struct dta{
int x,g,d;
};
dta a[100001];
int n,i,drive[100001],gold[100001],vec[100001],res,l,r,m;
main(){
scanf("%lld",&n);
for(i=1;i<=n;i++){
scanf("%lld%lld%lld",&a[i].x,&a[i].g,&a[i].d);
gold[i]=gold[i-1]+a[i].g;
drive[i]=drive[i-1]+a[i].d;
vec[i]=drive[i]-a[i].x;
}
for(i=n-1;i>0;i--)vec[i]=max(vec[i],vec[i+1]);
for(i=1;i<=n;i++){
l=i;
r=n;
while(l<r){
m=(l+r+1)>>1;
if(vec[m]>=drive[i-1]-a[i].x)l=m;
else r=m-1;
}
res=max(res,gold[r]-gold[i-1]);
}
printf("%lld",res);
}
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... |