Submission #485340

#	Time	Username	Problem	Language	Result	Execution time	Memory
485340		silverfox	K개의 묶음 (IZhO14_blocks)	C++14	0 / 100	1 ms	204 KiB

blocks

#include <bits/stdc++.h>
using namespace std;

const long long maxn = 1e5;
const long long maxk = 1e2;

long long a[maxn+1];
long long f[maxn+1][maxk+1];

int main()
{
    long long n,k; cin >> n >> k;
    for (long long i = 1; i <= n; i++) {cin >> a[i];}

    for (long long i = 1; i <= k; i++)
    {
        if (i == 1) {f[1][i] = a[1];} else {f[1][i] = LLONG_MAX;}
    }
    for (long long i = 2; i <= n; i++)
    {
        for (long long j = 1; j <= k; j++)
        {
            f[i][j] = LLONG_MAX;
            if (j > i) {continue;}

            long long curMax = a[i];
            for (long long x = i-1; x >= 1; x--)
            {
                f[i][j] = min(f[i][j], f[x][j-1] + curMax);
                curMax = max(curMax, a[x]);
            }
        }
    }
    cout << f[n][k];
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 18
• Subtask 3: 0 / 21
• Subtask 4: 0 / 47