摘要:
#include int a[100001],dp[100001]; int main() { int T,n; while(~scanf("%d",&n)) { for(int i=0;i=a[i]) //判断条件 { dp[i] = dp[i-... 阅读全文
摘要:
#include #include #define MaxN 10000 #define MaxC 10000 int Val[MaxN][MaxN]; double binaryKnapsack(int numItems, int *w,int *v, int capacity) { int i, j; for(i = 1; i Val... 阅读全文
摘要:
#include #include #define MaxN 10000 #define MaxC 10000 int Val[MaxN][MaxN]; double binaryKnapsack(int numItems, int *w,int *v, int capacity) { int i, j; for(i = 1; i V... 阅读全文