# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108779 | thebes | Art Exhibition (JOI18_art) | C++14 | 281 ms | 24824 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;
const int MN = 5e5+5;
typedef long long ll;
ll psa[MN], n, i, x, y, ans, mx;
pair<ll,ll> arr[MN];
int main(){
for(scanf("%lld",&n),i=1;i<=n;i++){
scanf("%lld%lld",&arr[i].first,&arr[i].second);
}
sort(arr+1,arr+n+1,[](pair<ll,ll>i,pair<ll,ll>j){return i.first<j.first;});
for(i=1;i<=n;i++){
psa[i]=psa[i-1]+arr[i].second-(arr[i].first-arr[i-1].first);
}
mx = -1LL<<60; ans = -1LL<<60;
for(i=n;i>=1;i--){
mx = max(mx, psa[i]);
ans = max(ans, mx-psa[i-1]+arr[i].first-arr[i-1].first);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |