제출 #37784

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

sequence

#include <bits/stdc++.h>
#define int long long
#define N 220
#define f first
#define s second
#define inf 2000000000
using namespace std;
typedef pair<int, int> pii;

int n, k, v[N], dp[N][N], sum[N], prox[N][N];

// (sum[mid] - sum[ini - 1])*( sum[n] - sum[mid] ) + solve(mid + 1, k - 1);


int solve(int i, int k)
{
	if(k >= n - i + 1) return 0;

	if(i == n || k <= 0) return 0;

	if(dp[i][k] != -1) return dp[i][k];

	int ini = i, fim = n - 1, mid, l, r, fl, fm, fr;

	for(int cnt = 0; cnt <= 30; cnt ++)
	{
		mid = (ini + fim)/2;

		l = (ini + mid)/2;

		r = (mid + fim)/2;

		fm = (sum[mid] - sum[ini - 1])*( sum[n] - sum[mid] ) + solve(mid + 1, k - 1);

		fl = (sum[l] - sum[ini - 1])*( sum[n] - sum[l] ) + solve(l + 1, k - 1);

		fr = (sum[r] - sum[ini - 1])*( sum[n] - sum[r] ) + solve(r + 1, k - 1);

		if(fl > max(fm, fr)) fim = r;

		else if(fm > max(fl, fr)) ini = l, fim = r;

		else ini = l;
	}

	prox[i][k] = mid;

	return dp[i][k] = (sum[mid] - sum[ini - 1])*( sum[n] - sum[mid] ) + solve(mid + 1, k - 1);;
}

void print(int ini, int k)
{
	if(!prox[ini][k]) return;

	cout<<prox[ini][k]<<" ";

	print(prox[ini][k] + 1, k - 1);
}

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

	cin>>n>>k;

	for(int i = 1; i <= n; i++) cin>>v[i], sum[i] = sum[i - 1] + v[i];

	memset(dp, -1, sizeof dp);

	cout<<solve(1, k)<<"\n";

	print(1, k);

	cout<<"\n";
}

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