제출 #172682

#제출 시각아이디문제언어결과실행 시간메모리
172682tselmegkh금 캐기 (IZhO14_divide)C++14
17 / 100
222 ms1784 KiB
#include<bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int x[N], g[N], d[N]; int main(){ int n; cin >> n; for(int i = 1; i <= n; i++){ cin >> x[i] >> g[i] >> d[i]; } long long curenergy = d[1], curgold = g[1], ans = 0; int r = 2; for(int i = 1; i <= n; i++){ while(r <= n && curenergy + d[r] >= x[r] - x[i]){ curenergy += d[r]; curgold += g[r]; r++; } ans = max(ans, curgold); curenergy -= d[i]; curgold -= g[i]; } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...