Submission #753034

#	Time	Username	Problem	Language	Result	Execution time	Memory
753034		Olympia	K개의 묶음 (IZhO14_blocks)	C++17	0 / 100	1 ms	328 KiB

blocks

#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <map>
#include <set>
using namespace std;
int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, K;
    cin >> N >> K;
    int64_t arr[N];
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }
    int64_t dp[N + 1][K + 1];
    int64_t INF = 1e17;
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= K; j++) {
            if (j == 0) {
                dp[i][j] = 0;
            } else if (i == 0) {
                dp[i][j] = INF;
            } else if (j == 1) {
                dp[i][j] = 0;
                for (int l = 0; l < i; l++) {
                    dp[i][j] = max(dp[i][j], arr[l]);
                }
            }else {
                int64_t myMax = 0;
                for (int l = i - 1; l >= 0; l--) {
                    myMax = max(myMax, arr[l]);
                    dp[i][j] = min(dp[i][j], dp[l][j - 1] + myMax);
                }
            }
        }
    }
    cout << dp[N][K] << endl;
}

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