Submission #336290

#	Time	Username	Problem	Language	Result	Execution time	Memory
336290		tengiz05	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	492 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 5005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, m, k;
vector<pii> dp[N];
int pr[N];
int pm[N];
void solve(int test_case){
	int i, j;
	cin >> n;
	for(i=1;i<=n;i++){
		cin >> a[i];
		pr[i]=a[i];pr[i]+=pr[i-1];
	}
	for(i=1;i<=n;i++){
		dp[i].pb({pr[i], 1});
	}
	for(i=1;i<=n;i++){
		for(j=1;j<i;j++){
			int s = pr[i]-pr[j];
			int pos = lower_bound(all(dp[j]), pii{s,-1})-dp[j].begin();//pos--;
			int mx=0;
			if(pos<0)continue;
			bool f = false;
			//if(i == 5)cout << s << '\n';
			for(k=0;k<pos;k++){
				if(dp[j][k].ff > s)continue;
				mx = max(mx, dp[j][k].ss);f=true;
				//if(i==5)cout << dp[j][k].ff << ' ' << dp[j][k].ss << '\n';
			}
			if(f)dp[i].pb({s, mx+1});
		}sort(all(dp[i]));
	}
/*	for(i=1;i<=n;i++){
		cout << "doing " << i<< '\n';
		for(auto [x, y] : dp[i]){
			cout << x << ' ' << y << '\n';
		}
	}*/
	int ans = 1;
	for(auto [x, y] : dp[n]){
		ans = max(ans, y);
	} 
	cout << ans << '\n';
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27