Submission #333300

#	Time	Username	Problem	Language	Result	Execution time	Memory
333300		Dovran	금 캐기 (IZhO14_divide)	C++11	17 / 100	2 ms	512 KiB

divide

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

using namespace std;

ll n, in[N], mx;
pii v[N];

int main(){
	cin>>n;
	for(int i=0; i<n; i++)
		cin>>in[i]>>v[i].ff>>v[i].ss, v[i].ff+=v[i-1].ff, v[i].ss+=v[i-1].ss;
	int l=0;
	for(int i=0; i<n; i++){
		while(v[i].ss-v[l-1].ss<in[i]-in[l])
			l++;
//		cout<<v[i].ff<<' '<<v[l-1].ff<<'\n';
		mx=max(mx, v[i].ff-v[l-1].ff);
	}
	cout<<mx;
}

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