제출 #977276

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977276		colossal_pepe	Bigger segments (IZhO19_segments)	C++17	37 / 100	169 ms	262144 KiB

segments

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int n;
vector<ll> a;

ll solve() {
	vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0));
	for (int i = n; i >= 1; i--) {
		for (int j = i; j <= n; j++) {
			auto itr = lower_bound(a.begin(), a.end(), 2 * a[j] - a[i - 1]);
			if (itr == a.end()) dp[i][j] = 1;
			else dp[i][j] = 1 + dp[j + 1][itr - a.begin()];
		}
		for (int j = n - 1; j >= i; j--) {
			dp[i][j] = max(dp[i][j], dp[i][j + 1]);
		}
	}
	return dp[1][1];
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n;
	a.resize(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		a[i] += a[i - 1];
	}
	cout << solve() << '\n';
	return 0;
}

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