Submission #503241

#	Time	Username	Problem	Language	Result	Execution time	Memory
503241		blue	Divide and conquer (IZhO14_divide)	C++17	48 / 100	1053 ms	2472 KiB

divide

#include <iostream>
using namespace std;

using ll = long long;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N;
    cin >> N;

    ll x[1+N], g[1+N], d[1+N];
    d[0] = 0;
    g[0] = 0;
    for(int i = 1; i <= N; i++)
    {
        cin >> x[i] >> g[i] >> d[i];
        d[i] += d[i-1];
        g[i] += g[i-1];
    }

    ll ans = 0;

    for(int l = 1; l <= N; l++)
        for(int r = l; r <= N; r++)
            if(d[r] - d[l-1] >= x[r] - x[l])
                ans = max(ans, g[r] - g[l-1]);

    cout << ans << '\n';
}

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