Submission #309924

#	Time	Username	Problem	Language	Result	Execution time	Memory
309924		sontruong02003	K개의 묶음 (IZhO14_blocks)	C++14	53 / 100	1081 ms	1536 KiB

blocks

#include <bits/stdc++.h>

using namespace std;
const int oo = 1000111000;

int n, k;
int a[100005];
int f[105][100005];
int32_t main()
{
    cin >> n >> k;
    for (int i=0;i<=k;i++)
    for (int j=0;j<=n;j++) f[i][j]=oo;
    f[0][0]=0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        //f[0][i]=0;
    }
    
    for (int i = 1; i <= k; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            int m = 0;
            for (int l = j - 1; l >= 0; l--)
            {
                m=max(a[l+1],m);
                f[i][j] = min(f[i - 1][l] + m, f[i][j]);
            }
        }
    }
    cout<<f[k][n];
}

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