A PACM Team
题目:有n个物品属性(p,a,c,m,g),其中g是获得的利润,然后总容量是P,A,C,M,求最大的收益。
思路:就是01背包,但是会爆内存,建议用short......没写出来还是对背包理解不行,好好看一下吧
代码:
#include<bits/stdc++.h>
#define sint short
using namespace std;
const int maxn = 38;
sint n, p[maxn], a[maxn], c[maxn], m[maxn], g[maxn], dp[maxn][maxn][maxn][maxn][maxn], P, A, C, M;
bool cs[maxn][maxn][maxn][maxn][maxn];
vector<sint> ans;
int main()
{
//freopen("in.txt", "r", stdin);
while(scanf("%hd", &n) != EOF)
{
for(sint i = 1; i <= n; i++) scanf("%hd%hd%hd%hd%hd", &p[i], &a[i], &c[i], &m[i], &g[i]);
scanf("%hd%hd%hd%hd", &P, &A, &C, &M);
memset(cs, false, sizeof(cs));
memset(dp, 0, sizeof(dp));
for(sint i = 1; i <= n; i++) {
for(sint ip = P; ip >= 0; ip--)
for(sint ia = A; ia >= 0; ia--)
for(sint ic = C; ic >= 0; ic--)
for(sint im = M; im >= 0; im--)
dp[i][ip][ia][ic][im] = dp[i-1][ip][ia][ic][im];
for(sint ip = P; ip >= p[i]; ip--)
for(sint ia = A; ia >= a[i]; ia--)
for(sint ic = C; ic >= c[i]; ic--)
for(sint im = M; im >= m[i]; im--)
if(dp[i-1][ip - p[i]][ia - a[i]][ic - c[i]][im - m[i]] + g[i] > dp[i][ip][ia][ic][im]){
dp[i][ip][ia][ic][im] = dp[i-1][ip - p[i]][ia - a[i]][ic - c[i]][im - m[i]] + g[i];
cs[i][ip][ia][ic][im] = true;
}
}
for(sint i = n-1; i >= 0; i--)
if(cs[i][P][A][C][M]) {
ans.push_back(i);
P -= p[i]; A -= a[i];
C -= c[i]; M -= m[i];
}
sort(ans.begin(), ans.end());
sint len = ans.size();
printf("%hd\n", len);
for(sint i = 0; i < len-1; i++) printf("%hd ", ans[i]);
if(len != 0) printf("%hd\n", ans[len-1]);
ans.clear();
}
return 0;
}