Submission #334230

#	Time	Username	Problem	Language	Result	Execution time	Memory
334230		limabeans	Divide and conquer (IZhO14_divide)	C++17	48 / 100	1092 ms	2668 KiB

divide

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

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;


int n;
ll x[maxn], g[maxn], d[maxn];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);
    cin>>n;
    for (int i=1; i<=n; i++) {
	cin>>x[i]>>g[i]>>d[i];
	g[i] += g[i-1];
	d[i] += d[i-1];
    }

    ll ans = 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]) {
		ans = max(ans, g[j]-g[i-1]);
	    }
	}
    }

    cout<<ans<<endl;    
    return 0;
}

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