uva 624 CD 01背包状态压缩记路径

#include<stdio.h>
#include<string.h>
#define maxn 10010
int n,w[maxn],m; //花费都是1
int dp[maxn];
int state[maxn];
int main()
{
int i,j,k,l,m;
while(~scanf("%d",&n))
{
scanf("%d",&m);
memset(dp,0,sizeof(dp));
memset(state,0,sizeof(state));
int r;
for(i=0;i<m;i++)
{
scanf("%d",&w[i]);
r=1<<i;
for(j=n;j>=w[i];j--)
{
if(dp[ j-w[i] ]+w[i] >dp[j])
{
dp[j]=dp[ j-w[i] ]+w[i];
state[j]=r|state[j-w[i]];  //状态也更新
}
}
}
for(i=0;i<m;i++)
{
r=1<<i;
if(r&state
)
printf("%d ",w[i]);
}
printf("sum:%d\n",dp
);
}
return 0;
}