题目
https://cn.vjudge.net/problem/POJ-1787
题意
裸地多重背包但要记录路径
思路
正常多重背包加个记录路径数组即可
#include <algorithm>
#include <iostream>
#include<cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int w[4] = {1,5,10,25};
int c[4];
int dp[10100];
int num[10100][4];
int p;
void complepark(int val,int op)
{
for(int j = val;j <= p;j++)
{
if(dp[j-val]+1 > dp[j]&&dp[j-val] >= 0)
{
dp[j] = dp[j-val] +1;
for(int i = 0;i < 4;i++)
{
num[j][i] = num[j-val][i];
}
num[j][op] = num[j-val][op] + 1;
}
}
}
void zeropark(int val,int x,int op)
{
for(int j = p;j >= val;j--)
{
if(dp[j-val]+ x> dp[j]&&dp[j-val] >= 0)
{
dp[j] = dp[j-val] + x;
for(int i = 0;i < 4;i++)
{
num[j][i] = num[j-val][i];
}
num[j][op] = num[j-val][op] + x;
}
}
}
void mul(int val,int x,int op)
{
if(val*x >= p)
{
complepark(val,op);
return ;
}
else
{
int k = 1;
while(k < x)
{
zeropark(k*val,k,op);
x -= k;
k<<=1;
}
if(x > 0)
{
zeropark(x*val,x,op);
}
}
}
int main()
{
while(scanf("%d",&p) != EOF)
{
for(int i = 0;i < 4;i++)
scanf("%d",&c[i]);
if(p==0&&c[0]+c[1]+c[2]+c[3] == 0) break;
memset(dp,-1,sizeof(dp));
dp[0] = 0;
memset(num,0,sizeof(num));
for(int i = 0;i < 4;i++)
{
if(c[i]) mul(w[i],c[i],i);
}
if(dp[p] < 0) printf("Charlie cannot buy coffee.\n");
else
{
printf("Throw in %d cents, %d nickels, %d dimes, and %d quarters.\n",num[p][0],num[p][1],num[p][2],num[p][3]);
}
}
return 0;
}
另一种做法O(nv)
因为前面一定不后面优,所以直接用前面凑出来的继续向下凑即可,因为当前一定是最优的
path数组记录当前下标是由哪个数凑出来的,做差即可知道选择了哪一种
#include <algorithm>
#include <iostream>
#include<cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
int v[4] = {1,5,10,25};
int dp[10010];
int path[10010];
int used[10010];
int num[4];
int ans[100];
int main()
{
int p;
while(scanf("%d",&p) != EOF)
{
for(int i = 0;i < 4;i++) scanf("%d",&num[i]);
if(p==0&&num[0]+num[1]+num[2]+num[3]==0)
break;
for(int i = 0;i <= p;i++) dp[i] = -INF;
memset(path,0,sizeof(path));
path[0] = -1;
dp[0] = 0;
for(int i = 0;i < 4;i++)
{
memset(used,0,sizeof(used));
for(int j = v[i];j <= p;j++)
{
if(dp[j-v[i]]+1>dp[j]&&dp[j-v[i]]>=0&&used[j-v[i]]<num[i])
{
dp[j] = dp[j-v[i]]+1;
used[j] = used[j-v[i]]+1;
path[j] = j -v[i];
}
}
}
memset(ans,0,sizeof(ans));
if(dp[p] < 0) printf("Charlie cannot buy coffee.\n");
else
{
int i = p;
while(1)
{
if(path[i] == -1) break;
ans[i-path[i]]++;
i = path[i];
}
printf("Throw in %d cents, %d nickels, %d dimes, and %d quarters.\n",ans[v[0]],ans[v[1]],ans[v[2]],ans[v[3]]);
}
}
return 0;
}