Submission #334230

#TimeUsernameProblemLanguageResultExecution timeMemory
334230limabeansDivide and conquer (IZhO14_divide)C++17
48 / 100
1092 ms2668 KiB
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...