# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211101 | ld_minh4354 | Art Exhibition (JOI18_art) | C++14 | 244 ms | 32760 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 int long long
#define fi first
#define se second
int n,i,dp[500010],d[500010],v[500010],ans;
pair<int,int> x[500010];
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for (i=1;i<n+1;i++) cin>>x[i].fi>>x[i].se;
sort(x+1,x+n+1);
for (i=1;i<n+1;i++) d[i]=x[i].fi,v[i]=x[i].se;
for (i=1;i<n;i++) d[i]=d[i+1]-d[i];d[n]=0;
dp[1]=v[1]-d[1];
for (i=2;i<n+1;i++) dp[i]=max(v[i]-d[i],v[i]-d[i]+dp[i-1]);
for (i=1;i<n+1;i++) dp[i]=dp[i]+d[i];
ans=0;
for (i=1;i<n+1;i++) ans=max(ans,dp[i]);
cout<<ans;
}
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... |