coding__girl的博客

求两个字符串x，y的最长公共子序列 dp[i][j]表示x的前缀xi和y的前缀yj的LCS的长度 状态转移方程为： if(a[i]==b[j]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=Max{dp[i-1][j],dp[i],[j-1]}; #include <iostream> #include <cstring&...

You are planning to take some rest and to go out on vacation, but you really don’t know which cities you should visit. So, you ask your parents for help. Your mother says “My son, you MUST visit Paris...

In a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be ful lled, and this is not a trivial task for the countries (maybe except f...