【Leetcode】国王挖金矿

参考该文章

https://www.cnblogs.com/henuliulei/p/10041737.html

#include <iostream>
#include <cstring>

using namespace std;

int main (int argc, char** argv){

    int workerNumber = ;
    int auNumber = ;
    int maxVal = ;
    int auVal[] = {, , , , };
    int auCost[] = {, , , , };
    bool choose[] = {false, false, false, false, false};
    int valueT[auNumber+][workerNumber+];
    std::memset(valueT, , sizeof(valueT));

    // initialize the valueT
    for(int i = ; i <= auNumber; i++){
        for(int j = ; j <= workerNumber; j++){
            if (j < auCost[i-])
                valueT[i][j] = valueT[i-][j];
            else
                valueT[i][j] = max(valueT[i-][j], valueT[i-][j-auCost[i-]]+auVal[i-]);
        }
    }

    for(int i = ; i <= auNumber; i++){
        for(int j = ; j <= workerNumber; j++){
            std::cout << valueT[i][j] << " ";
        }
        std::cout << std::endl;
    }

    // get the result
    int k = workerNumber;
    for(int i = auNumber; i > ; i--){
        if(valueT[i][k] > valueT[i-][k]){
            choose[i-] = true;

            k = k - auCost[i-];
        }
    }

    for(int i = ; i < auNumber; i++)
        cout << choose[i] << " ";

    return ;
}