标签：
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 44257 Accepted Submission(s): 18442
/* Accepted 2602 78MS 5360K 552 B G++ */ #include"cstdio" #include"cstring" #include"algorithm" using namespace std; const int MAXN=1005; int dp[MAXN][MAXN]; int n,W; int v[MAXN],w[MAXN]; int main() { int T; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&W); memset(dp,0,sizeof(dp)); for(int i=0;i<n;i++) scanf("%d",&v[i]); for(int i=0;i<n;i++) scanf("%d",&w[i]); for(int i=0;i<n;i++) for(int j=0;j<=W;j++) if(j<w[i]) dp[i+1][j]=dp[i][j]; else dp[i+1][j]=max(dp[i][j],dp[i][j-w[i]]+v[i]); printf("%d\n",dp[n][W]); } return 0; }
贴一个记忆化搜索
/* Accepted 2602 327MS 5432K 613 B G++ */ #include"cstdio" #include"cstring" #include"algorithm" using namespace std; const int MAXN=1005; int dp[MAXN][MAXN]; int n,W; int v[MAXN],w[MAXN]; int dfs(int i,int wei) { if(dp[i][wei]) return dp[i][wei]; if(i==n) return 0; int res; if(wei>=w[i]) res=max(dfs(i+1,wei-w[i])+v[i],dfs(i+1,wei)); else res=dfs(i+1,wei); return dp[i][wei]=res; } int main() { int T; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&W); memset(dp,0,sizeof(dp)); for(int i=0;i<n;i++) scanf("%d",&v[i]); for(int i=0;i<n;i++) scanf("%d",&w[i]); printf("%d\n",dfs(0,W)); } return 0; }
标签：
原文地址：http://www.cnblogs.com/program-ccc/p/5185444.html
