Submission #719110

#	Time	Username	Problem	Language	Result	Execution time	Memory
719110		fdnfksd	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1083 ms	2512 KiB

divide

#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=2e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll ans=-inf;
ll n,x[maxN],g[maxN],d[maxN];
void solve()
{
    cin >> n;
    for(int i=1;i<=n;i++) cin >> x[i] >> g[i] >> d[i];
    for(int i=1;i<=n;i++)
    {
        ll sum=g[i],re=d[i];
        ans=max(ans,sum);
        for(int j=i+1;j<=n;j++)
        {
            re+=d[j];
            sum+=g[j];
            if(re>=x[j]-x[i]) ans=max(ans,sum);
        }
    }
    cout << ans;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

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