제출 #107881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107881		SamAnd	수열 (APIO14_sequence)	C++17	0 / 100	2102 ms	38268 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
const int N = 202;

int n, m;
int a[N];
int p[N];

int dp[N][N][N];
int pp[N][N][N];
int pk[N][N][N];

void tp(int l, int r, int k)
{
    if (k == 0)
        return;
    cout << pp[l][r][k] << endl;
    tp(l, pp[l][r][k], pk[l][r][k]);
    tp(pp[l][r][k] + 1, r, k - 1 - pk[l][r][k]);
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    for (int i = 1; i <= n; ++i)
        p[i] = p[i - 1] + a[i];
    for (int d = 1; d <= n; ++d)
    {
        for (int l = 1; l <= n - d + 1; ++l)
        {
            int r = l + d - 1;
            for (int k = 1; k + 1 <= d; ++k)
            {
                for (int i = l; i < r; ++i)
                {
                    for (int kk = 0; kk <= k - 1; ++kk)
                    {
                        if ((p[i] - p[l - 1]) * (p[r] - p[i]) + dp[l][i][kk] + dp[i + 1][r][k - 1 - kk] > dp[l][r][k])
                        {
                            dp[l][r][k] = (p[i] - p[l - 1]) * (p[r] - p[i]) + dp[l][i][kk] + dp[i + 1][r][k - 1 - kk];
                            pp[l][r][k] = i;
                            pk[l][r][k] = kk;
                        }
                    }
                }
            }
        }
    }
    cout << dp[1][n][m] << endl;
    tp(1, n, m);
    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