Submission #400599

#	Time	Username	Problem	Language	Result	Execution time	Memory
400599		Azimjon	Split the sequence (APIO14_sequence)	C++17	39 / 100	2081 ms	5720 KiB

sequence

// Muallif: Azimjon Mehmonali o'g'li

#include <bits/stdc++.h>

using namespace std;

#define int long long

const long double PI = 3.1415926535897;
const int mod = 1000000007LL;
const int INF = 1e18;
const int N = 111111;
const int K = 211;

int n, k;
int a[N], p[N], dp[K][N], pa[K][N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> k;

	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		p[i] = p[i - 1] + a[i];
	}

	for (int i = 1; i <= k; i++) {
		for (int j = 1; j <= n; j++) {
			for (int l = 1; l < j; l++) {
				if (dp[i][j] < dp[i - 1][l] + (p[j] - p[l]) * p[l]) {
					dp[i][j] = dp[i - 1][l] + (p[j] - p[l]) * p[l];
					pa[i][j] = l;
				}
			}
		}
	}

	cout << dp[k][n] << endl;
	int x = pa[k][n];
	while (k--) {
		cout << max(1ll, x) << " ";
		if (x == pa[k][x])
			break;
		x = pa[k][x];
	}

	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 17 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29