제출 #1113248

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1113248		stdfloat	Bigger segments (IZhO19_segments)	C++17	27 / 100	1569 ms	70984 KiB

segments

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
 
#define ff  first
#define ss  second
#define pii pair<int, int>
 
#define all(v) (v).begin(), (v).end()
 
int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
 
	int n;
	cin >> n;
 
	vector<int> a(n);
	for (auto &i : a)
		cin >> i;
 
	vector<vector<ll>> dp(n, vector<ll>(n, LLONG_MAX));
	for (int j = 0; j < n; j++) {
		for (int i = 0; i < n; i++) {
			ll sm = 0;
			for (int k = i; k >= 0; k--) {
				sm += a[k];
 
				if (j && k && dp[k - 1][j - 1] <= sm) {
					dp[i][j] = sm; break;
				}
			}
 
			if (!j) dp[i][0] = sm;
		}
	}
 
	for (int i = 0; i <= n; i++)
		if (i == n || dp[n - 1][i] == LLONG_MAX) return cout << i, 0;
}

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