Submission #340731

#	Time	Username	Problem	Language	Result	Execution time	Memory
340731		amunduzbaev	Divide and conquer (IZhO14_divide)	C++14	0 / 100	1 ms	364 KiB

divide

/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 21;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, ans, pos[N], e[N], gg[N];

void solve(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>pos[i]>>gg[i]>>e[i];
		if(i) e[i] += e[i-1];
		if(i) gg[i] += gg[i-1];
	}

	for(int i=0;i<n;i++){
		umax(ans, gg[i] - (i ? gg[i-1] : 0));
		for(int j=i;j<n;j++){
			int cur = e[j] - (i ? e[i-1] : 0);
			//cout<<i<<" "<<j<<endl;
			cout<<e[j] - (i ? e[i-1] : 0)<<" "<<pos[j] - (i ? pos[i-1] : 0)<<" "<<gg[j] - (i ? gg[i-1] : 0)<<endl;
			if(cur >= pos[j] - (i ? pos[i-1] : 0)) umax(ans, gg[j] - (i ? gg[i-1] : 0));
		}
	}cout<<ans<<"\n";
	return;
}

int main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

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