ACM学习-动态规划-背包问题

// ACM学习-动态规划-背包问题.cpp : 定义控制台应用程序的入口点。
//


#include "stdafx.h"
#include<iostream>
using namespace std;


int num, max_weight, max_volume;
int v[6], w[6], c[6], t[6];
int f[6][501][101];
int s[6][501][101];
int _tmain(int argc, _TCHAR* argv[])
{
//cout << "good" << endl;


cin >> num;
for (int i = 1; i <= num; i++){
cin >> v[i] >> w[i] >> c[i] >> t[i];
}
cin >> max_weight >> max_volume;
memset(f,0,sizeof(f));
int n, x, y;
for (n = 1; n <= num; n++)
for (x = 1; x <= max_weight;x++)
for (y = 1; y <= max_volume; y++){
int max_buy_num = c[n];
if (x/w[n] < max_buy_num)max_buy_num = x/w[n];
if (y / v[n] < max_buy_num)max_buy_num = y / v[n];
for (int i = 0; i <= max_buy_num; i++){
if (f[n - 1][y - i*v[n]][x - i*w[n]] + i*t[n]>f[n][y][x])
{
f[n][y][x] = f[n - 1][y - i*v[n]][x - i*w[n]] + i*t[n];
s[n][y][x] = i;
}

}
}
int ans = 0,tempx,tempy;
for (int x = 0; x <= max_weight;x++)
for (int y = 0; y < max_volume;y++)
if (f[num][y][x]>ans)
{
ans = f[num][y][x];
tempx = x;
tempy = y;
}
cout << ans << endl;
for (int i = num; i >= 1; i--){
int cn = s[i][tempy][tempx];
cout << i << ":" << cn << endl;
tempy -= cn*v[i];
tempx -= cn*w[i];
}


return 0;
}