# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62225 | kingpig9 | Art Exhibition (JOI18_art) | C++11 | 348 ms | 115196 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;
typedef long long ll;
typedef pair<ll, ll> pll;
const int MAXN = 500010;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))
void setmax (ll &a, ll b) {
if (a < b) {
a = b;
}
}
int N;
pll P[MAXN];
ll V[MAXN];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%lld %lld", &P[i].fi, &P[i].se);
}
sort(P + 1, P + N + 1);
for (int i = N; i >= 1; i--) {
P[i].fi -= P[i - 1].fi;
}
for (int i = 1; i <= N; i++) {
V[i] = V[i - 1] - P[i].fi + P[i].se;
}
ll ans = LLONG_MIN;
ll suffmx = LLONG_MIN;
for (int i = N; i >= 1; i--) {
setmax(suffmx, V[i]);
setmax(ans, suffmx - V[i] + P[i].se);
}
printf("%lld\n", 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... |