hdu 2602 Bone Collector

01背包的状态转换方程 f[i,j] = Max{ f[i-1,j-Wi]+Pi( j >= Wi ), f[i-1,j] }

#include<stdio.h>
#include<string.h>
int dp[1010][1010],w[1010],val[1010];
int max(int a,int b){
return a>b?a:b;
}
int main(){
int n,m,i,j,t;

scanf("%d",&t);
while(t--){
memset(dp,0,sizeof(dp));
memset(w,0,sizeof(w));
memset(val,0,sizeof(val));
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
scanf("%d",&val[i]);
}
for(i=1;i<=n;i++){
scanf("%d",&w[i]);
}
for(i=1;i<=n;i++){
for(j=0;j<=m;j++){
if(j>=w[i]){
dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+val[i]);//放还是不放的选择

}else{
dp[i][j]=dp[i-1][j];
}
}
}
printf("%d\n",dp
[m]);
}
return 0;
}