Submission #167175

#	Time	Username	Problem	Language	Result	Execution time	Memory
167175		Dovran	Divide and conquer (IZhO14_divide)	C++11	17 / 100	223 ms	5560 KiB

divide

#include <bits/stdc++.h>
#define N 100009
#define pii pair <int, int>
#define ff first
#define ss second
#define pb push_back
#define ll long long

using namespace std;

ll n, v[N], mx, a[N], b[N];

int main(){
	cin>>n;
	for(int i=1; i<=n; i++){
		cin>>v[i]>>a[i]>>b[i];
		a[i]+=a[i-1], b[i]+=b[i-1];
	}
	int l=1, r=1;
	while(r<=n){
		if(v[r]-v[l] <= b[r]-b[l-1])
			mx=max(mx, a[r]-a[l-1]), r++;
		else
			l++;
//		cout<<l<<' '<<r<<endl;
	}
	cout<<mx<<endl;
}

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