# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37850 | Just_Solve_The_Problem | Divide and conquer (IZhO14_divide) | C++11 | 3 ms | 5532 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 ll long long
const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
ll pg[N], pd[N];
int x[N], g[N], d[N], a[N];
int suf[N];
ll ans = 0;
main () {
int n; scanf ("%d", &n);
for (int i = 1; i <= n; i++) {
scanf ("%d %d %d", x + i, g + i, d + i);
pd[i] = pd[i - 1] + d[i];
pg[i] = pg[i - 1] + g[i];
a[i] = pd[i] - x[i];
}
suf[n + 1] = -inf;
for (int i = n; i >= 1; i--) {
suf[i] = max(suf[i + 1], a[i]);
}
for (int i = 1; i <= n; i++) {
int l = i;
int r = n;
while (r - l > 1) {
int mid = (l + r) >> 1;
if (suf[mid] >= pd[i - 1] - x[i]) {
l = mid;
} else {
r = mid;
}
}
if (suf[r] >= pd[i - 1] - x[i]) {
l = r;
}
ans = max(ans, pg[l] - pg[i - 1]);
}
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... |