摘要:
参考博客http://blog.csdn.net/sj13051180/article/details/6687674关于0-1背包与多重背包讲的很细,适合入门。贴我的代码:#include <iostream>#include <stdio.h>using namespace std;int main(){ int dp[12900]; int n,m; int v[3405]; int w[3405]; while(cin >> n >> m){ for(int j=0;j<=m;j++) dp[j]=0; f... 阅读全文