loving coding

ACM模板【最长上升子序列】输出长度O(n*n)while(scanf("%s%s",s1+1,s2+1)!=EOF) { l1 = strlen(s1+1); l2 = strlen(s2+1); for(i = 0; i <= l1;i ++) f[i][0] = 0; ...

ACM模板void CompletePack(int cost,int weight,int V){//完全背包 int i; for( i = cost; i <= V;i ++) dp[i] = max(dp[i],dp[i-cost]+weight); return ;}void ZeroOnePack(int cost,int weight,int