Submission #570510

#	Time	Username	Problem	Language	Result	Execution time	Memory
570510		Hanksburger	Divide and conquer (IZhO14_divide)	C++17	17 / 100	1 ms	340 KiB

divide

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[100005], b[100005], c[100005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n, cur=1, ans=0;
    cin >> n;
    for (ll i=1; i<=n; i++)
    {
        ll x, y;
        cin >> a[i] >> x >> y;
        b[i]=b[i-1]+x;
        c[i]=c[i-1]+y;
    }
    for (ll i=1; i<=n; i++)
    {
        while (cur<=n && c[cur]-c[i-1]>=a[cur]-a[i])
            cur++;
        ans=max(ans, b[cur-1]-b[i-1]);
    }
    cout << ans;
    return 0;
}

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