# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520563 | krit3379 | 금 캐기 (IZhO14_divide) | C++17 | 40 ms | 6500 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>
using namespace std;
#define N 100005
using pii = pair<long long,long long>;
long long x[N],g[N],p[N],ans;
deque<pii> dq;
int main(){
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%lld %lld %lld",&x[i],&g[i],&p[i]);
ans=max(ans,g[i]);
g[i]+=g[i-1];
p[i]+=p[i-1];
}
for(i=n;i>0;i--){
auto it=lower_bound(dq.begin(),dq.end(),(pii){p[i-1]-x[i],-1});
if(it!=dq.end())ans=max(ans,(*it).second-g[i-1]);
if(dq.empty()||p[i]-x[i]>dq.back().first)dq.push_back({p[i]-x[i],g[i]});
}
printf("%lld",ans);
return 0;
}
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... |