# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794081 | alex_2008 | Divide and conquer (IZhO14_divide) | C++14 | 38 ms | 7128 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.
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int x[N], suffmx[N];
ll d[N], g[N];
int main() {
int n;
scanf("%d", &n);
vector <pair<ll, int>> v;
v.push_back({ -2e9, 0 });
for (int i = 1; i <= n; i++) {
scanf("%d %lld %lld", &x[i], &g[i], &d[i]);
d[i] += d[i - 1];
g[i] += g[i - 1];
v.push_back({ d[i] - x[i], i });
}
sort(v.begin(), v.end());
for (int i = n; i >= 1; i--) {
suffmx[i] = max(suffmx[i + 1], v[i].second);
}
ll answer = 0;
for (int i = 1; i <= n; i++) {
ll cur = d[i - 1] - x[i];
int l = 1, r = n, ans = -1;
while (l <= r) {
int mid = (l + r) / 2;
if (v[mid].first >= cur) {
ans = mid;
r = mid - 1;
}
else l = mid + 1;
}
answer = max(answer, g[suffmx[ans]] - g[i - 1]);
}
printf("%lld\n", answer);
}
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... |