Submission #345189

#	Time	Username	Problem	Language	Result	Execution time	Memory
345189		vonatlus	K개의 묶음 (IZhO14_blocks)	C++14	53 / 100	5 ms	2028 KiB

blocks

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 200;
const ll INF = (1ll<<50);

void fin() {
#ifdef AM
    freopen(".in", "r", stdin);
#endif        
}                   

ll dp[N][N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr), fin();
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int& x : a) {
        cin >> x;
    }
    a.insert(a.begin(), 0);
    for (int i = 0; i <= n; ++i) {
        fill(dp[i], dp[i]+N, INF);
    }    
    dp[0][0] = 0;
    for (int t = 1; t <= k; ++t) {
        for (int i = 1; i <= n; ++i) {
            int mx = 0;
            for (int j = i; j > 0; --j) {
                mx = max(mx, a[j]);
                dp[i][t] = min(dp[i][t], dp[j-1][t-1] + mx); 
            }
        }
    }
    cout << dp[n][k];
    return 0;
}

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