제출 #41946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
41946		Aidyn_A	수열 (APIO14_sequence)	C++14	0 / 100	1 ms	356 KiB

sequence

#include <stdio.h>
#include <bits/stdc++.h>			

#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()
#define what_is(x) #x << " is " << (x)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = (int)1e5 + 123;
const ll INF = (ll)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;

void megaRandom() {
	unsigned int FOR;
 	asm("rdtsc" : "=A"(FOR));
  srand(FOR);
}

int n, k;
int a[N];
ll dp[210][N];
ll pref[N];
pii pr[210][N];

int main() {
	megaRandom();
	cin >> n >> k;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
		pref[i] = pref[i - 1] + a[i];
	}
	dp[0][0] = 0;
	for(int it = 1; it <= k; it ++) {
		for(int i = 1; i <= n; i ++) {
			for(int j = 0; j < i; j ++) {
				ll val = dp[it - 1][j] + pref[j] * (pref[i] - pref[j]);
				if(val > dp[it][i]) {
					dp[it][i] = val;
					pr[it][i] = mp(it - 1, j); 
				}				
			}
		}
	}
	cout << dp[k][n] << "\n";
	int x = k, y = n;
	vector<int> g;
	while(x > 0) {
		//cout << x << ' ' << y << "\n";
		pii to = pr[x][y];
		g.pb(to.S);
		//cout << y << ' ';
		x = to.F, y = to.S;
	}
	reverse(all(g));
	for(int i = 0; i < sz(g); i ++)
		cout << g[i] << ' ';
	return 0;  
}

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