Submission #13125

#	Time	Username	Problem	Language	Result	Execution time	Memory
13125		gs14004	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1000 ms	3428 KiB

divide

#include <cstdio>
#include <algorithm>
using namespace std;

int n;
long long x[100005], g[100005], d[100005];

int main(){
    scanf("%d",&n);
    for (int i=1; i<=n; i++) {
        scanf("%lld %lld %lld",&x[i],&g[i],&d[i]);
        d[i] += d[i-1];
        g[i] += g[i-1];
    }
    long long r = 0;
    for (int i=1; i<=n; i++) {
        for (int j=i; j<=n; j++) {
            if(x[j] - x[i] <= d[j] - d[i-1]){
                r = max(r,g[j] - g[i-1]);
            }
        }
    }
    printf("%lld",r);
}

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