Submission #344587

#TimeUsernameProblemLanguageResultExecution timeMemory
344587_zheksenovDivide and conquer (IZhO14_divide)C++17
48 / 100
1088 ms2284 KiB
#include <bits/stdc++.h> using namespace std; #define int long long typedef long long ll; const int N = 1e5 + 7; struct S { int x, g, d; }; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int mx = 0; vector<S> a(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i].x >> a[i].g >> a[i].d; if (a[i].d >= 1) mx = max(mx, a[i].g); } vector<int> p(n + 1), t(n + 1); for (int i = 1; i <= n; i++) p[i] = p[i - 1] + a[i].g; for (int i = 1; i <= n; i++) t[i] = t[i - 1] + a[i].d; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { if (a[j].x - a[i].x <= t[j] - t[i - 1]) mx = max(mx, p[j] - p[i - 1]); } } cout << mx << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...