#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 5e5+10;
const int MAXA = 2e3+10;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmx(int &a, int b){ a = max(a, b); }
int n, x[MAXN], g[MAXN], d[MAXN], prg[MAXN], prd[MAXN];
signed main(){
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
int ANS = 0;
for(int i=1; i<=n; i++){ cin >> x[i] >> g[i] >> d[i]; chmx(ANS, g[i]); }
for(int i=1; i<=n; i++) prg[i] = prg[i-1]+g[i];
for(int i=1; i<=n; i++) prd[i] = prd[i-1]+d[i];
vector <pii> vec;
for(int i=1; i<=n; i++){
vec.pb({x[i]-prd[i], -i}); // query
vec.pb({x[i]-prd[i-1], i}); // update
}
sort(vec.rbegin(), vec.rend());
// for(auto in : vec) cout << in.se << " se\n";
set <int> s;
for(auto in : vec){
if(in.se > 0){
s.insert(in.se);
} else {
in.se = -in.se;
if(!s.empty() && *(s.begin()) < in.se){
int idx = in.se;
int id = *(s.begin());
chmx(ANS, prg[idx]-prg[id-1]);
}
}
}
cout << ANS << '\n';
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
504 KB |
Output is correct |
| 18 |
Correct |
2 ms |
604 KB |
Output is correct |
| 19 |
Correct |
1 ms |
460 KB |
Output is correct |
| 20 |
Correct |
1 ms |
604 KB |
Output is correct |
| 21 |
Correct |
2 ms |
604 KB |
Output is correct |
| 22 |
Correct |
2 ms |
604 KB |
Output is correct |
| 23 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 24 |
Correct |
4 ms |
1116 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
504 KB |
Output is correct |
| 18 |
Correct |
2 ms |
604 KB |
Output is correct |
| 19 |
Correct |
1 ms |
460 KB |
Output is correct |
| 20 |
Correct |
1 ms |
604 KB |
Output is correct |
| 21 |
Correct |
2 ms |
604 KB |
Output is correct |
| 22 |
Correct |
2 ms |
604 KB |
Output is correct |
| 23 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 24 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 25 |
Correct |
3 ms |
1116 KB |
Output is correct |
| 26 |
Correct |
5 ms |
1688 KB |
Output is correct |
| 27 |
Correct |
7 ms |
1748 KB |
Output is correct |
| 28 |
Correct |
38 ms |
7352 KB |
Output is correct |
| 29 |
Correct |
42 ms |
7620 KB |
Output is correct |
| 30 |
Correct |
100 ms |
14956 KB |
Output is correct |
| 31 |
Correct |
71 ms |
13836 KB |
Output is correct |
| 32 |
Correct |
77 ms |
14008 KB |
Output is correct |
| 33 |
Correct |
63 ms |
13756 KB |
Output is correct |
| 34 |
Correct |
69 ms |
13760 KB |
Output is correct |
| 35 |
Correct |
77 ms |
14268 KB |
Output is correct |
| 36 |
Correct |
77 ms |
14524 KB |
Output is correct |
