제출 #688425

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
688425		luka1234	Divide and conquer (IZhO14_divide)	C++14	48 / 100	20 ms	1212 KiB

divide

#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;
ll prefg[5001];
ll prefe[5001];
int main(){
    ll n;
    cin>>n;
    vector<pair<ll,pair<ll,ll> > > v;
    for(ll k=1;k<=n;k++){
    	ll x,y,z;
    	cin>>x>>y>>z;
    	v.push_back({x,{y,z}});
    	prefg[k]=prefg[k-1]+y;
    	prefe[k]=prefe[k-1]+z;
	}
	ll sz=v.size();
	ll mx=0;
	for(ll i1=0;i1<sz;i1++){
		for(ll j1=i1;j1<sz;j1++){
			ll i=i1+1;
			ll j=j1+1;
			ll len=v[j1].ff-v[i1].ff;
			ll en=prefe[j]-prefe[i-1];
			ll gol=prefg[j]-prefg[i-1];
			if(en>=len){
				mx=max(mx,gol);
			}
		}
	}
	cout<<mx;
    return 0;
}

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