# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1178796 | vyaduct | Art Exhibition (JOI18_art) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void setIo(string in="", string out=""){
if (!in.empty() && !out.empty()){
freopen(in.c_str(), "r", stdin);
freopen(out.c_str(), "w", stdout);
}
ios::sync_with_stdio(false);
cin.tie(0);
}
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define vt vector
#define pb push_back
#define F first
#define S second
void solve(){
int n; cin>>n;
vt<pair<ll,ll>> A(n);
for (int i=0;i<n;i++){
cin>>A[i].F>>A[i].S;
}
sort(all(A));
vt<ll> B(n, 0);
for (int i=1;i<n;i++) B[i] = A[i].F-A[i-1].F;
vt<ll> C(n);
for (int i=0;i<n;i++) C[i] = A[i].S - B[i];
vt<ll> P(n+1, 0);
ll min_pref = 0;
ll mx;
ll ans = -1e9;
for (int i=0;i<n;i++){
P[i+1] = P[i] + C[i];
mx = P[i+1] - min_pref;
min_pref = min(min_pref, P[i+1]);
ans = max(ans, mx);
}
cout << ans << endl;
}
int main() {
setIo();
int tt=1;
// cin>>tt;
while(tt--) solve();
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... |