Submission #344570

#TimeUsernameProblemLanguageResultExecution timeMemory
344570bachaquerDivide and conquer (IZhO14_divide)C++14
17 / 100
1 ms364 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back using namespace std; ll n, x, g, d; struct lol { ll x; ll g; ll d; }; int main() { //freopen("divide.in", "r", stdin); //freopen("divide.out", "w", stdout); cin >> n; vector<lol> v; vector<ll> uf(n, 0); ll mx = -1; ll sum = 0; for (int i = 0; i < n; i++) { cin >> x >> g >> d; v.pb({x, g, d}); if (i == 0 || v[i - 1].d + v[i].d < (v[i].x - v[i - 1].x)) { sum = 0; } else { v[i - 1].d -= (v[i].x - v[i - 1].x); if (v[i - 1].d < 0) { v[i].d += v[i - 1].d; v[i - 1].d = 0; } } sum += v[i].g; mx = max(mx, sum); } cout << mx; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...