Submission #86755

#	Time	Username	Problem	Language	Result	Execution time	Memory
86755		duy_tran	Divide and conquer (IZhO14_divide)	C++14	0 / 100	1078 ms	3436 KiB

divide

#include<bits/stdc++.h>
using namespace std;

const int maxn=(int)1e5+50;
int n,x[maxn];
long long gold[maxn],energy[maxn],a[maxn];

int main()
{
    cin>>n;

    for(int i=1;i<=n;++i)
    {
        long long g,d;
        cin>>x[i]>>g>>d;

        gold[i]=gold[i-1]+g;
        energy[i]=energy[i-1]+d;
        a[i]=energy[i]-x[i];
    }

    long long Max=0;

    for(int i=1;i<=n;++i)
    {
        for(int j=0;j<=i;++j)
        {
            if(a[i]>=a[j])
            {
                Max=max(Max,gold[i]-gold[j-1]);
                break;
            }
        }
    }

    cout<<Max;
}

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