제출 #107897

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

sequence

#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const long long INF = 1000000009000000009;

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

long long dp[N][202];
int pp[N][202];
int main()
{
    //freopen("input.txt", "r", stdin);
    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 i = 1; i <= n; ++i)
    {
        for (int k = 1; k <= m; ++k)
            dp[i][k] = -INF;
    }
    for (int i = 1; i <= n; ++i)
    {
        for (int k = 1; k <= min(m, i - 1); ++k)
        {
            for (int j = 1; j < i; ++j)
            {
                if (dp[j][k - 1] + p[j] * p[i] - p[j] * p[j] > dp[i][k])
                {
                    dp[i][k] = dp[j][k - 1] + p[j] * p[i] - p[j] * p[j];
                    pp[i][k] = j;
                }
            }
        }
    }
    cout << dp[n][m] << endl;
    int i = n;
    for (int k = m; k > 0; --k)
    {
        cout << pp[i][k] << ' ';
        i = pp[i][k];
    }
    cout << endl;
    return 0;
}

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