动态规划-01背包

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 2001;//, maxn = 101;
int m, n;
//01背包 
int w[maxn], c[maxn];
int f[maxn]; 
int main()
{
    int t;
    freopen("mdd.txt","r",stdin);
    scanf("%d",&t);
    while(t--){
        memset(f,0,sizeof(f));
        scanf("%d%d",&n, &m);            //背包容量m和物品数量n
       for (int i=1; i <= n; i++)
        scanf("%d",&c[i]); 
            //每个物品的重量和价值
            for(int i=1;i<=n;i++)
            scanf("%d",&w[i]);
        for (int i=1; i <= n; i++)             //设f(v)表示重量不超过v公斤的最大价值
        for (int v = m; v >= w[i]; v--)  //注意是逆序
            f[v] = max(f[v-w[i]]+c[i], f[v]);
    printf("%d\n",f[m]);                      // f(m)为最优解
    }
    return 0;
}

动态规划-01背包

原文：https://www.cnblogs.com/mch5201314/p/10324836.html