Submission #868139

#	Time	Username	Problem	Language	Result	Execution time	Memory
868139		12345678	Divide and conquer (IZhO14_divide)	C++17	100 / 100	51 ms	12628 KiB

divide

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e5+5;
ll d[nx], g[nx], p[nx], qs[nx], qsp[nx], n, res, mn=LLONG_MAX;
set<pair<ll, ll>> s;

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++)
    {
        if (qsp[i-1]-d[i]<mn) mn=qsp[i-1]-d[i], s.insert({mn, -qs[i-1]});
        res=max(res, prev(s.upper_bound(make_pair(qsp[i]-d[i], LLONG_MAX)))->second+qs[i]);
    }
    cout<<res;
}

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