필기시험 문제 26 - 이중 01 가방 문제
2676 단어 필기시험 문제
#include
#include
#include
#include
using namespace std;
int dp[601][601][601];
int dp2[601][601];
//memset(dp, 0, sizeof(dp));
int maxEnergyGenerate(int V, int N, int M, int* volumes, int* masses, int* energies) {
for (int i = 1; i <= N; i++) { //
for (int j = V; j >= 0; j--) { //
for (int k = M; k >= 0; k--) { //
if (j - volumes[i - 1]<0 || k - masses[i - 1]<0)
dp[i][j][k] = dp[i - 1][j][k];
else
dp[i][j][k] = max(dp[i - 1][j][k], dp[i - 1][j - volumes[i - 1]][k - masses[i - 1]] + energies[i - 1]);
}
}
}
return dp[N][V][M];
}
int mytest(int v, int n, int m, int* volumes, int* masses, int* energies) {
for (int i = 1; i <= n; i++) {
for (int j = v; j >= volumes[i - 1]; j--) {
for (int k = m; k >= masses[i - 1]; k--) {
dp2[j][k] = max(dp2[j][k], dp2[j - volumes[i - 1]][k - masses[i - 1]] + energies[i - 1]);
}
}
}
return dp2[v][m];
}
int main() {
int v = 100, n = 5, m = 15;
int volumes[] = { 50,40,30,20,10 };
int masses[] = { 1,2,3,9,5 };
int energies[] = { 300,480,270,200,180 };
cout << maxEnergyGenerate(v, n, m, volumes, masses, energies) << endl;
cout << "new: " << endl;
cout << mytest(v, n, m, volumes, masses, energies) << endl;
return 0;
}