Submission #1132613

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132613		Halym2007	Bigger segments (IZhO19_segments)	C++17	27 / 100	1599 ms	71056 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <int, int>
#define dur exit(0)
#define dur1 return(0)
const int N = 3e3 + 5;
ll a[N], dp[N][N];
int main () {
//	freopen ("input.txt", "r", stdin);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j) {
			dp[i][j] = 1e15;
		}	
	}
	dp[0][0] = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= i; ++j) {
			ll sum = 0;
			for (int k = i; k >= 1; k--) {
				sum += a[k];
				if (dp[k - 1][j - 1] <= sum) {
					dp[i][j] = min (dp[i][j], sum);
				}
			}
		}
	}
	for (int i = n; i > 0; i--) {
		if (dp[n][i] != 1e15) {
			cout << i;
			return 0;
		}
	}
}

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