# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340690 | Kerim | Divide and conquer (IZhO14_divide) | C++17 | 116 ms | 16492 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 MAXN 200009
#define INF 1000000000000007
#define ll long long
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
using namespace std;
ll F[MAXN],e[MAXN],g[MAXN],ans,res;
int x[MAXN],n,c;
map<ll,int>pm;
void upd(int x,ll val){for(;x<MAXN;x+=x&(-x))F[x]=min(F[x],val); }
ll tap(int x){for(res=INF;x;x-=x&(-x))res=min(res,F[x]);return res;}
int main(){
for(int i=0;i<MAXN;i++)F[i]=INF;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%lld%lld",x+i,g+i,e+i);
g[i]+=g[i-1];e[i]+=e[i-1];
pm[e[i-1]-x[i]]=pm[e[i]-x[i]]=1;
}tr(it,pm)it->second=++c;
for(int i=1;i<=n;i++){
upd(pm[e[i-1]-x[i]],g[i-1]);
ans=max(ans,g[i]-tap(pm[e[i]-x[i]]));
}printf("%lld\n",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... |