제출 #646391

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
646391		Richem	K개의 묶음 (IZhO14_blocks)	C++14	53 / 100	1088 ms	8256 KiB

blocks

#include <iostream>
#define int long long
using namespace std;

const int MAX_NB = 1e5+42, MAX_BLOC = 101, INF = 1e9;

int nbNombre, blocRequis;

int nombre[MAX_NB];
int dp[MAX_NB][MAX_BLOC];

signed main() {
    cin >> nbNombre >> blocRequis;

    for(int i = 0; i < nbNombre; i++) {
        for(int j = 0; j < blocRequis; j++) dp[i][j] = INF;
    }

    for(int cur = 0; cur < nbNombre; cur++) {
        cin >> nombre[cur];

        dp[cur][0] = nombre[cur];
        if(cur > 0)
            dp[cur][0] = max(dp[cur][0], dp[cur-1][0]);
    }

    for(int nbBloc = 1; nbBloc < blocRequis; nbBloc++) {
        for(int cur = nbBloc; cur < nbNombre; cur++) {
            int maxi = 0;
            for(int preced = cur; preced > 0; preced--) {
                maxi = max(maxi, nombre[preced]);

                dp[cur][nbBloc] = min(dp[cur][nbBloc], dp[preced-1][nbBloc-1] + maxi);
            }
        }
    }

    cout << dp[nbNombre-1][blocRequis-1];
}

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