Submission #868134

#	Time	Username	Problem	Language	Result	Execution time	Memory
868134		12345678	Divide and conquer (IZhO14_divide)	C++17	48 / 100	18 ms	860 KiB

divide

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=5e3+5;
ll d[nx], g[nx], p[nx], qs[nx], qsp[nx], n, res;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>d[i]>>g[i]>>p[i], qs[i]=qs[i-1]+g[i], qsp[i]=qsp[i-1]+p[i];
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=i; j++)
        {
            if (d[i]-d[j]<=qsp[i]-qsp[j-1]) 
            {
                res=max(res, qs[i]-qs[j-1]);
            }
        }
    }
    cout<<res;
}

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