Submission #1346645

#TimeUsernameProblemLanguageResultExecution timeMemory
1346645kawhietDivide and conquer (IZhO14_divide)C++20
48 / 100
1095 ms4328 KiB
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 47
#endif

#define int long long

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> x(n), g(n), d(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> g[i] >> d[i];
    }
    vector<int> p(n + 1), k(n + 1);
    for (int i = 0; i < n; i++) {
        p[i + 1] = p[i] + d[i];
        k[i + 1] = k[i] + g[i];
    }
    int ans = 0;
    for (int l = 0; l < n; l++) {
        for (int r = l; r < n; r++) {
            int e = p[r + 1] - p[l];
            int g = k[r + 1] - k[l];
            if (e >= x[r] - x[l]) {
                ans = max(ans, g);
            }
        }
    }
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...