背包问题源码

//BY wanda1416

#include <fstream>

#includusing namespace std;

#define MAXSIZE 1000

int A[MAXSIZE+1][MAXSIZE+1],B[MAXSIZE+1][MAXSIZE+1];

int c[MAXSIZE+1],w[MAXSIZE+1];

int F(int n,int v){

if(n==0) return 0;

if(!A[n][v] && v >= c[n])

A[n][v] = F(n-1,v-c[n]) +w[n];

if(!B[n][v]) B[n][v] = F(n-1,v);

return A[n][v]>B[n][v]?A[n][v]:B[n][v];

}

int main(int argc,char *argv[])

{

int n,v;

memset(A,0,sizeof(A));

memset(B,0,sizeof(B));

ifstream in("in.txt");

ofstream out("out.txt");

in>>n>>v;

for(int i=1;i<=n;i++)

in>>c[i]>>w[i];

out<<F(n,v);

return 0;

}

得思考一下，哈哈