Submission #677979

#	Time	Username	Problem	Language	Result	Execution time	Memory
677979		YENGOYAN	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	324 KiB

segments

/*
	//\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\\
	\\                                    //
	//  271828___182845__904523__53602__  \\
	\\  87___47____13______52____66__24_  //
	//  97___75____72______47____09___36  \\
	\\  999595_____74______96____69___67  //
	//  62___77____24______07____66__30_  \\
	\\  35___35____47______59____45713__  //
	//                                    \\
	\\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\//
												*/

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>

using namespace std;
using ll = long long;
const int N = 3e5 + 5;
const ll mod = 1e9 + 7, inf = 1e12;

void solve() {
	// start time : 00:50
	int n; cin >> n;
	vector<ll> v(n), pref(n + 1);
	for (int i = 0; i < n; ++i) {
		cin >> v[i];
		pref[i + 1] = pref[i] + v[i];
	}
	vector<vector<ll>> dp(n + 1, vector<ll>(n + 1));
	ll ans = 1;
	for (int r = 1; r <= n; ++r) {
		dp[r][1] = 1;
		for (int l = 2; l <= r; ++l) {
			ll sm = pref[r] - pref[l - 1];
			for (int l1 = 1; l1 < l; ++l1) {
				ll sm1 = pref[l - 1] - pref[l1 - 1];
				if (sm >= sm1) {
					dp[r][l] = max(dp[r][l], dp[l - 1][l1] + 1);
				}
			}
			ans = max(ans, dp[r][l]);
		}
	}
	cout << ans;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	//int t; cin >> t;
	//while (t--) 
		solve();
}

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