oj.uz

답안 #646402

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
646402 2022-09-29T18:10:28 Z Richem K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 0 ms 212 KB 
#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, prefixMin;
};

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, INF});

        for(int cur = nbBloc; cur < nbNombre; cur++) {
            while(s.top().taille <= nombre[cur])
                s.pop();

            int rep = min(s.top().prefixMin, dp[s.top().pos][nbBloc-1] + nombre[cur]);
            dp[cur][nbBloc] = rep;

            s.push({nombre[cur], cur, rep});
        }
    }
    for(int i = 0; i < nbNombre; i++) {
        for(int j = 0; j < blocRequis; j++)
            cout << dp[i][j] << " ";
        cout << endl;
    }

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

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -