제출 #503914

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
503914		sumit_kk10	수열 (APIO14_sequence)	C++17	21 / 100	94 ms	131076 KiB

sequence

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define S second
#define F first 
#define pb push_back
using namespace std;
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
long long n, k, a[N], pre[N], par[100001][201];
vector<long long> dp(N), cur_dp(N);
 
long long C(int i, int j){
	return (pre[i] - pre[j]) * pre[j];
}
 
void compute(int l, int r, int tl, int tr, int kk){
	if(l > r)
		return;
	int mid = (l + r) / 2;
	pair<long long, int> p = {INT_MIN, -1};
	for(int i = tl; i < min(mid, tr + 1); ++i){
		if((dp[i] + C(mid, i)) > p.F){
			p.F = dp[i] + C(mid, i);
			p.S = i;
		}
	}
	par[mid][kk] = p.S;
	cur_dp[mid] = p.F;
	compute(l, mid - 1, tl, p.S, kk);
	compute(mid + 1, r, p.S, tr, kk);
}

void solve(){
	cin >> n >> k;
	for(int i = n - 1; i >= 0; --i)
		cin >> a[i];
	for (int i = 0; i <= k; ++i) {
        for (int j = 0; j <= n; ++j) {
            par[i][j] = -1;
        }
    }
	pre[0] = a[0];
	for(int i = 1; i < n; ++i)
	    pre[i] = pre[i - 1] + a[i];
	for(int i = 1; i <= k; ++i){
		compute(0, n - 1, 0, n - 1, i);
		dp = cur_dp;
	}
	long long ans = 0, pos = 0;
	for(int i = 0; i < n; ++i){
		if(dp[i] > ans){
			ans = dp[i];
			pos = i;
		}
	}
	cout << ans << '\n';
	int ct = k;
	vector<int> res;
	while(ct > 0){
		assert(n - par[pos][ct] - 1 >= 1 && n - par[pos][ct] - 1 <= n);
		cout << n - par[pos][ct] - 1 << ' ';
		pos = par[pos][ct];
	    --ct;
	}
}
 
int main(){
	fast;
	int t = 1;
	// cin >> t;
	while(t--)
		solve();
	return 0;
}

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