제출 #990879

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
990879		ToniB	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	444 KiB

segments

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

const int N = 505;
typedef long long ll;

int n, a[N], dp[N][N];
ll pre[N];

int main(){
	cin >> n;
	for (int i = 0; i < n; ++i) cin >> a[i];
	
	pre[0] = a[0];
	for (int i = 1; i < n; ++i) pre[i] = a[i] + pre[i - 1];
	
	for (int i = 0; i < n; ++i) {
		dp[0][i] = 1;
	}
	
	for (int i = 1; i < n; ++i) {
		for (int j = i; j < n; ++j) {
			for (int k = 0; k < i; ++k) {
				if (pre[j] - pre[i - 1] >= pre[i - 1] - (k ? pre[k - 1] : 0)) dp[i][j] = max(dp[i][j], dp[k][i - 1] + 1);
			}
		}
	}
	
	int ans = 0;
	for (int i = 0; i < n; ++i) ans = max(ans, dp[i][n - 1]);
	
	cout << ans << "\n";
	
	return 0;
}

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