jianjun的专栏

LCS模板 合并字符串，最长公共子序列只输出一次 Advanced FruitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2026 Accepted Submission(s): 1036Special JudgeProblem DescriptionThe company "21st Century F

最大公共子序列长度 （LCS）Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28498 Accepted Submission(s): 12738Problem DescriptionA subsequence of a given sequence is the given sequenc

Palindrome 倒转字符串，然后与原字符串求最长公共子序列，然后用长度减就行了这个题目要求字符串为5000，所以二维数组肯定爆了，所以用滚动数组，用dp[2][M] PalindromeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4062 Accepted Submission(s): 1384

最长公共子序列和最长公共连续子串：          最长公共连续子串（Longest CommonSubstring） 和最长公共子序列（LongestCommon Subsequence, LCS）的区别：子串（Substring）是串的一个连续的部分，子序列（Subsequence）则是从不改变序列的顺序，而从序列中去掉任意的元素而获得的新序列；更简略地说，前者（子串）的字符的位置必须连