摘要： 考虑全面，01背包问题：代码如下：#include<string.h>#include<stdio.h>#include<stdlib.h>#define MAXN 100 + 5#define MAXN1 25000 + 100int coin[MAXN], f[MAXN][MAXN1];int n, m, sum, c;/*int cmp(const void* _p, const void* _q){ int *p = (int *)_p; int *q = (int *)_q; return *p - *q;}*/void dp(){ int i, 阅读全文