Submission #916636

#	Time	Username	Problem	Language	Result	Execution time	Memory
916636		atom	Divide and conquer (IZhO14_divide)	C++17	17 / 100	1 ms	604 KiB

divide

#include "bits/stdc++.h"
// @JASPER'S BOILERPLATE
using namespace std;
using ll = long long;

#ifdef JASPER
#include "debug.h"
#else
#define debug(...) 166
#endif

const int N = 5e3 + 5;
int n;
int x[N], g[N], e[N];
int dp[N], fe[N], fg[N];
signed main() {
    cin.tie(0) -> sync_with_stdio(0);
        
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> x[i] >> g[i] >> e[i];
    for (int i = 1; i <= n; ++i) {
        fg[i] = fg[i - 1] + g[i];
        fe[i] = fe[i - 1] + e[i];
    }

    for (int i = 1; i <= n; ++i) dp[i] = g[i];

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j < i; ++j) {
            int req = (x[i] - x[j]);
            int have = (fe[i] - fe[j - 1]);
            if (have >= req) 
                dp[i] = max(dp[i], dp[j] + (fg[i] - fg[j]));
        }
    }
    // for (int i = 1; i <= n; ++i) {
    //     debug(i, dp[i]);
    // }
    cout << *max_element(dp + 1, dp + 1 + n) << "\n";
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 31
• Subtask 3: 0 / 52