제출 #633756

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633756		shmad	수열 (APIO14_sequence)	C++17	28 / 100	146 ms	22820 KiB

sequence

#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<int> >;

const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const double eps = 1e-6;

int n, k;
ll a[N], dp[1005][205];
int pr[1005][205];

void solve () {
	cin >> n >> k;
	vt<ll> p(n + 1, 0);
	for (int i = 1; i <= n; i++) cin >> a[i], p[i] = p[i - 1] + a[i];
	memset(dp, 0, sizeof(dp));
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= k; j++) {
			for (int x = 0; x < i; x++) {
				ll res = dp[x][j - 1] + (p[i] - p[x]) * (p[n] - p[i]);
				if (dp[i][j] <= res) dp[i][j] = res, pr[i][j] = x;
			}
		}
	}
	vt<int> path;
	int cur = 0;
	for (int i = n; i >= 1; i--) {
		if (dp[i][k] > dp[cur][k]) cur = i;
	}
	cout << dp[cur][k] << '\n';
	while (k) {
		path.pb(cur);
		cur = pr[cur][k];
		k--;
	}
	reverse(all(path));
	for (int i: path) cout << i << ' ';
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

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