Submission #918010

#	Time	Username	Problem	Language	Result	Execution time	Memory
918010		borisAngelov	Divide and conquer (IZhO14_divide)	C++17	48 / 100	1016 ms	2132 KiB

divide

#include <bits/stdc++.h>

using namespace std;

const int maxn = 100005;

int n;

struct Element
{
    int pos;
    int gold;
    int energy;
};

Element a[maxn];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i].pos >> a[i].gold >> a[i].energy;
    }

    long long ans = 0;

    for (int i = 1; i <= n; ++i)
    {
        long long sumEnergy = 0;
        long long sumGold = 0;

        for (int j = i; j <= n; ++j)
        {
            sumEnergy += a[j].energy;
            sumGold += a[j].gold;

            if (sumEnergy >= a[j].pos - a[i].pos)
            {
                ans = max(ans, sumGold);
            }
        }
    }

    cout << ans << endl;

    return 0;
}

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