#include "bits/stdc++.h"
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned;
using i16 = short;
using u16 = unsigned short;
using ld = long double;
using ii = pair<int, int>;
const i64 linf = 1e15L;
struct BIT {
vector<i64> bit;
BIT(int n) {
bit.assign(n + 1, -linf);
}
void upd(int k, i64 x) {
for(++k; k < int(bit.size()); k += k & -k) bit[k] = max(x, bit[k]);
}
i64 query(int k) {
i64 ans = -linf;
for(++k; k > 0; k -= k & -k) ans = max(ans, bit[k]);
return ans;
}
};
void solve() {
int n;
cin >> n;
vector<int> x(n + 1, 0);
vector<i64> g(n + 1, 0), e(n + 1, 0), p;
BIT bit(n);
i64 ans = 0;
for(int i = 1; i <= n; ++i) {
cin >> x[i] >> g[i] >> e[i];
ans = max(ans, g[i]);
g[i] += g[i - 1];
e[i] += e[i - 1];
p.emplace_back(e[i] - x[i]);
}
sort(p.begin(), p.end());
for(int i = 1; i <= n; ++i) {
int k = lower_bound(p.begin(), p.end(), e[i] - x[i]) - p.begin();
ans = max(ans, g[i] + bit.query(k));
k = lower_bound(p.begin(), p.end(), e[i - 1] - x[i]) - p.begin();
bit.upd(k, -g[i - 1]);
}
cout << ans << '\n';
}
int main() {
ios_base :: sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--) solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
308 KB |
Output is correct |
| 7 |
Correct |
0 ms |
256 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
316 KB |
Output is correct |
| 10 |
Correct |
0 ms |
304 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
308 KB |
Output is correct |
| 7 |
Correct |
0 ms |
256 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
316 KB |
Output is correct |
| 10 |
Correct |
0 ms |
304 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
1 ms |
304 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
368 KB |
Output is correct |
| 20 |
Correct |
1 ms |
332 KB |
Output is correct |
| 21 |
Correct |
1 ms |
332 KB |
Output is correct |
| 22 |
Correct |
1 ms |
328 KB |
Output is correct |
| 23 |
Correct |
2 ms |
564 KB |
Output is correct |
| 24 |
Correct |
3 ms |
588 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
308 KB |
Output is correct |
| 7 |
Correct |
0 ms |
256 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
316 KB |
Output is correct |
| 10 |
Correct |
0 ms |
304 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
1 ms |
304 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
368 KB |
Output is correct |
| 20 |
Correct |
1 ms |
332 KB |
Output is correct |
| 21 |
Correct |
1 ms |
332 KB |
Output is correct |
| 22 |
Correct |
1 ms |
328 KB |
Output is correct |
| 23 |
Correct |
2 ms |
564 KB |
Output is correct |
| 24 |
Correct |
3 ms |
588 KB |
Output is correct |
| 25 |
Correct |
2 ms |
580 KB |
Output is correct |
| 26 |
Correct |
4 ms |
892 KB |
Output is correct |
| 27 |
Correct |
5 ms |
936 KB |
Output is correct |
| 28 |
Correct |
20 ms |
3204 KB |
Output is correct |
| 29 |
Correct |
21 ms |
3396 KB |
Output is correct |
| 30 |
Correct |
42 ms |
6844 KB |
Output is correct |
| 31 |
Correct |
36 ms |
5692 KB |
Output is correct |
| 32 |
Correct |
38 ms |
5696 KB |
Output is correct |
| 33 |
Correct |
36 ms |
5556 KB |
Output is correct |
| 34 |
Correct |
36 ms |
5508 KB |
Output is correct |
| 35 |
Correct |
39 ms |
6152 KB |
Output is correct |
| 36 |
Correct |
40 ms |
6188 KB |
Output is correct |
