Submission #372445

#TimeUsernameProblemLanguageResultExecution timeMemory
372445amano_hinaArt Exhibition (JOI18_art)C++14
100 / 100
568 ms30956 KiB
#include<bits/stdc++.h> using namespace std; long long n,a[500005],b[500005],c[500005],d[500005],ans; pair<long long,long long> p[500005]; int main() { cin>>n; for(int i=0;i<n;i++) { cin>>a[i]>>b[i]; p[i].first=a[i]; p[i].second=b[i]; } sort(p,p+n); for(int i=0;i<n;i++) { a[i]=p[i].first; b[i]=p[i].second; //cout<<a[i]<<" "<<b[i]<<'\n'; } c[0]=b[0]; d[0]=b[0]; for(int i=1;i<n;i++) { c[i]=c[i-1]+b[i]; d[i]=d[i-1]+b[i]; } for(int i=0;i<n;i++) { d[i]=d[i]-a[i]; c[i]=c[i]-b[i]-a[i]; } ans=b[0]; for(int i=n-2;i>=0;i--) { d[i]=max(d[i],d[i+1]); } for(int i=1;i<n;i++) { c[i]=min(c[i],c[i-1]); } for(int i=0;i<n;i++) { ans=max(ans,d[i]-c[i]); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...