제출 #162151

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
162151		kostia244	수열 (APIO14_sequence)	C++14	22 / 100	184 ms	3064 KiB

sequence

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll mod = 998244353;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll n, a[55], pref[55], dp[55][55][55];
pair<ll, ll> p[55][55][55];
ll f(ll l, ll r, ll i) {
	ll a = pref[i] - pref[l - 1];
	ll b = pref[r] - pref[i];
	return a * b;
}
ll get(ll l, ll r, ll k) {
	if (dp[l][r][k] != -1)
		return dp[l][r][k];
	ll &ans = dp[l][r][k];
	ans = 0;
	p[l][r][k] = {-1, -1};
	for (int spl = l; spl < r; spl++) {
		for (int y = 0; y < k; y++) {
			ll t = f(l, r, spl) + get(l, spl, y) + get(spl + 1, r, k - y - 1);
			ans = max(ans, t);
			if (ans == t) {
				p[l][r][k] = {spl, y};
			}
		}
	}
	return ans;
}
void backtrack(ll l, ll r, ll k) {
	if (p[l][r][k].first == -1)
		return;
	backtrack(l, p[l][r][k].first, p[l][r][k].second);
	cout << p[l][r][k].first << " ";
	backtrack(p[l][r][k].first + 1, r, k - 1 - p[l][r][k].second);
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	memset(dp, -1, sizeof dp);
	ll k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
		cin >> a[i], pref[i] = pref[i - 1] + a[i];
	cout << get(1, n, k) << "\n";
	backtrack(1, n, k);
}

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