#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
int32_t main() {
ios_base::sync_with_stdio(false);
cout.tie(0); cin.tie(0);
int n;
cin >> n;
vector<array<int, 3> > v(n+1);
for(int i=1; i<=n; i++) cin >> v[i][0] >> v[i][1] >> v[i][2];
ll pref[n+1][3];
memset(pref, 0, sizeof(pref));
for(int i=1; i<=n; i++)
for(int j=1; j<3; j++) pref[i][j] = pref[i-1][j] + v[i][j];
ll ans = 0;
vector<ll> mn(n+1, 1e18);
for(int i=1; i<=n; i++) {
// for(int j=i; j<=n; j++)
// if(pref[j][2] - v[j][0] >= pref[i-1][2] - v[i][0] + 1) ans = max(ans, pref[j][1] - pref[i-1][1]);
mn[i] = min(mn[i-1], pref[i-1][2] - v[i][0] + 1);
int l=1, r=i, p=i;
while(l <= r) {
int mid = (l + r) / 2;
if(mn[mid] <= pref[i][2] - v[i][0]) p = mid, r = mid - 1;
else l = mid + 1;
}
ans = max(ans, pref[i][1] - pref[p-1][1]);
}
cout << ans << '\n';
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
356 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
356 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
344 KB |
Output is correct |
| 15 |
Correct |
0 ms |
344 KB |
Output is correct |
| 16 |
Correct |
0 ms |
448 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
416 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
0 ms |
348 KB |
Output is correct |
| 22 |
Correct |
1 ms |
348 KB |
Output is correct |
| 23 |
Correct |
1 ms |
604 KB |
Output is correct |
| 24 |
Correct |
1 ms |
604 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
356 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
344 KB |
Output is correct |
| 15 |
Correct |
0 ms |
344 KB |
Output is correct |
| 16 |
Correct |
0 ms |
448 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
416 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
0 ms |
348 KB |
Output is correct |
| 22 |
Correct |
1 ms |
348 KB |
Output is correct |
| 23 |
Correct |
1 ms |
604 KB |
Output is correct |
| 24 |
Correct |
1 ms |
604 KB |
Output is correct |
| 25 |
Correct |
1 ms |
604 KB |
Output is correct |
| 26 |
Correct |
2 ms |
860 KB |
Output is correct |
| 27 |
Correct |
2 ms |
860 KB |
Output is correct |
| 28 |
Correct |
10 ms |
2396 KB |
Output is correct |
| 29 |
Correct |
10 ms |
3676 KB |
Output is correct |
| 30 |
Correct |
23 ms |
7508 KB |
Output is correct |
| 31 |
Correct |
17 ms |
6488 KB |
Output is correct |
| 32 |
Correct |
18 ms |
6492 KB |
Output is correct |
| 33 |
Correct |
17 ms |
6236 KB |
Output is correct |
| 34 |
Correct |
18 ms |
6356 KB |
Output is correct |
| 35 |
Correct |
19 ms |
6736 KB |
Output is correct |
| 36 |
Correct |
20 ms |
6872 KB |
Output is correct |
