/*
/\ /\
| ).|.( |
| >-< |
=========
It's AdilkhanKo miaaaaaau
*/
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl "\n"
#define foreach(it, S) for(__typeof (S.begin()) it = S.begin(); it != S.end(); it++)
#define mp make_pair
#define f first
#define s second
#define name ""
#define _ ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int MaxN = int (2e5) + 256;
const int INF = int(1e9);
const int mod = (int)(1e9) + 7;
long long n, a[MaxN], m, t, x[MaxN], g[MaxN], d[MaxN], D[MaxN], G[MaxN];
bool used[MaxN];
int main () { _
/* #ifdef ONLINE_JUDGE
freopen (name".in","r",stdin);
freopen (name".out","w",stdout);
#else
freopen (".in","r",stdin);
freopen (".out","w",stdout);
#endif*/
cin >> n;
for(int i = 1; i <= n; i++){
cin >> x[i] >> g[i] >> d[i];
D[i] = D[i - 1] + d[i];
G[i] = G[i - 1] + g[i];
}
int l = 1, r = 1;
ll ans = 0, cnt = 0;
while(r <= n){
if((D[r] - D[l - 1] >= x[r] - x[l])){
ans = max(G[r] - G[l - 1], ans);
r++;
}else{
l++;
}
}
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
11292 KB |
Output is correct |
2 |
Correct |
0 ms |
11292 KB |
Output is correct |
3 |
Correct |
0 ms |
11292 KB |
Output is correct |
4 |
Correct |
0 ms |
11292 KB |
Output is correct |
5 |
Correct |
0 ms |
11292 KB |
Output is correct |
6 |
Correct |
0 ms |
11292 KB |
Output is correct |
7 |
Correct |
0 ms |
11292 KB |
Output is correct |
8 |
Correct |
0 ms |
11292 KB |
Output is correct |
9 |
Correct |
0 ms |
11292 KB |
Output is correct |
10 |
Correct |
0 ms |
11292 KB |
Output is correct |
11 |
Correct |
0 ms |
11292 KB |
Output is correct |
12 |
Correct |
0 ms |
11292 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
11292 KB |
Output is correct |
2 |
Correct |
0 ms |
11292 KB |
Output is correct |
3 |
Incorrect |
0 ms |
11292 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
11292 KB |
Output is correct |
2 |
Correct |
0 ms |
11292 KB |
Output is correct |
3 |
Correct |
4 ms |
11292 KB |
Output is correct |
4 |
Correct |
14 ms |
11292 KB |
Output is correct |
5 |
Correct |
15 ms |
11292 KB |
Output is correct |
6 |
Correct |
37 ms |
11292 KB |
Output is correct |
7 |
Correct |
27 ms |
11292 KB |
Output is correct |
8 |
Correct |
19 ms |
11292 KB |
Output is correct |
9 |
Correct |
20 ms |
11292 KB |
Output is correct |
10 |
Incorrect |
33 ms |
11292 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |