FengBS

摘要： 题目描述：http://poj.org/problem?id=3624基本的01背包dp[i-1][v]=max{dp[i-1][v],dp[i-1][v-weight[i]]+value[i]}#include<stdio.h>#include<memory.h>int max(int a,int b){ return a>b?a:b;}int w[3500],v[3500],dp[13000];void main(){ int n,m,i,j,sum; scanf("%d%d",&n,&m); sum=0; memset(d 阅读全文