首页 > ACM题库 > HDU-杭电 > hdu 2253 Longest Common Subsequence Again待解决[解题报告]C++
2014
01-04

hdu 2253 Longest Common Subsequence Again待解决[解题报告]C++

Longest Common Subsequence Again

问题描述 :

Everyone knows LCS problem:

For example:
str1 = "GCTAT"
str2 = "CGATTA"

the longest common subsequence is "GTT" of them.So you should print "3".

I’m sure you can easily sovle it.So the challenge is coming again.(^_^)

输入:

For each case,there are two lines.one is string A,the other is string B.
the string Process to end of file.Each string will have at most 30000 characters.
All the characters are in upper-case.

输出:

For each case,there are two lines.one is string A,the other is string B.
the string Process to end of file.Each string will have at most 30000 characters.
All the characters are in upper-case.

样例输入:

GCTAT
CGATTA 

ABCFBC
ABFCAB

样例输出:

3
4