제출 #646450

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

blocks

#include <iostream>
#include <stack>
#define int long long

using namespace std;

const int MAX_NOMBRE = 1e5+42, INF = 1e12, MAX_BLOC = 101;

struct Elem{
    int taille, pos;
};

int nbNombre, blocRequis;
int nombre[MAX_NOMBRE];

int dp[MAX_NOMBRE][MAX_BLOC];

stack<Elem> s;

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++) {
        while(!s.empty()) s.pop();

        s.push({INF, nbBloc-1});

        for(int cur = nbBloc; cur < nbNombre; cur++) {
            int mini = INF;
            while(s.top().taille <= nombre[cur]) {
                mini = min(mini, dp[s.top().pos][nbBloc-1] + nombre[cur]);
                s.pop();
            }

            dp[cur][nbBloc] = min(dp[s.top().pos][nbBloc-1] + nombre[cur], dp[s.top().pos][nbBloc]);
            dp[cur][nbBloc] = min(dp[cur][nbBloc], mini);
            s.push({nombre[cur], cur});
        }
    }

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

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