摘要：ACM模板【最长上升子序列】输出长度while(scanf("%s%s",s1+1,s2+1)!=EOF) { l1 = strlen(s1+1); l2 = strlen(s2+1); for(i = 0; i f[i][j-1])... 阅读全文

摘要：ACM模板void CompletePack(int cost,int weight,int V){//完全背包 int i; for( i = cost; i = cost; i --) dp[i] = max(dp[i],dp[i-cost]+weigh... 阅读全文