WILL的专栏

问题描述： 给你两个字符串，求其最长公共子序列 代码： #include #include #define M 10007 using namespace std; char s1[M],s2[M]; int main() { int n,i,j,len1,len2; cin>>n; while(n--) { cin>>s1>>s2;

http://acm.hdu.edu.cn/showproblem.php?pid=1677 Problem Description Dilworth is the world’s most prominent collector of Russian nested dolls: he literally has thousands of them! You know, the woode

http://acm.hdu.edu.cn/showproblem.php?pid=1087 Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and kn

首先将要看到如何运用动态编程查找两个 DNA 序列的最长公共子序列（longest common subsequence，LCS）。发现了新的基因序列的生物学家通常想知道该基因序列与其他哪个序列最相似。查找 LCS 是计算两个序列相似程度的一种方法：LCS 越长，两个序列越相似。 子序列中的字符与子字符串中的字符不同，它们不需要是连续的。例如，ACE 是 ABCDE 的子序列，但不是它的子字符串

最长公共上升子序列（LCIS）的O(n^2)算法 预备知识：动态规划的基本思想，LCS，LIS。 问题：字符串a，字符串b，求a和b的LCIS（最长公共上升子序列）。 首先我们可以看到，这个问题具有相当多的重叠子问题。于是我们想到用DP搞。DP的首要任务是什么？定义状态。 1定义状态F[i][j]表示以a串的前i个字符b串的前j个字符且以b[j]为结尾构成的LCIS的长

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=47&mosmsg=Submission+received+with+ID+13303577 Background Many problems in Computer S

http://poj.org/problem?id=3356 Description Let x and y be two strings over some finite alphabet A. We would like to transform x into y allowing only operations given below: Deletion: a lette

http://acm.hdu.edu.cn/showproblem.php?pid=1423 Problem Description This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.   Input Each sequence

http://acm.hdu.edu.cn/showproblem.php?pid=1080 Problem Description It is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted

最长公共子序列问题LCS 问题描述 参考解答 动态规划算法可有效地解此问题。下面我们按照动态规划算法设计的各个步骤来设计一个解此问题的有效算法。 1.最长公共子序列的结构 解最长公共子序列问题时最容易想到的算法是穷举搜索法，即对X的每一个子序列，检查它是否也是Y的子序列，从而确定它是否为X和Y的公共子序列，并且在检查过程中选出最长的公共子序列。X的所有子序列都检查过后即可求出X和

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=113 The Problem You are planning to take some rest and to go out on vacation, but you really don't

http://acm.hdu.edu.cn/showproblem.php?pid=4681 Problem Description Given 3 strings A, B, C, find the longest string D which satisfy the following rules: a) D is the subsequence of A b) D is

http://acm.hdu.edu.cn/showproblem.php?pid=1159 Problem Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = an

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=17&problem=1475&mosmsg=Submission+received+with+ID+13386999 Wavio is a sequence of integers. It h