c001: 10405 - Longest Common Subsequence
Tags : DP LCS
Accepted rate : 714人/1105人 ( 65% ) [非即時]
評分方式:
Strictly

最近更新 : 2015-08-28 14:34

Content

Sequence 1:  

Sequence 2: 

 

Given two sequences of characters, print the length of the longest common subsequence of both sequences. For example, the longest common subsequence of the following two sequences:

abcdgh aedfhr 

is adh of length 3.

Input consists of pairs of lines. The first line of a pair contains the first string and the second line contains the second string. Each string is on a separate line and consists of at most 1,000 characters

For each subsequent pair of input lines, output a line containing one integer number which satisfies the criteria stated above.

 

Input
Output
Sample Input
a1b2c3d4e
zz1yy2xx3ww4vv
abcdgh
aedfhr
abcdefghijklmnopqrstuvwxyz
a0b0c0d0e0f0g0h0i0j0k0l0m0n0o0p0q0r0s0t0u0v0w0x0y0z0
abcdefghijklmnzyxwvutsrqpo
opqrstuvwxyzabcdefghijklmn
Sample Output
4
3
26
14
測資資訊:
記憶體限制: 512 MB
公開 測資點#0 (100%): 1.0s , <1M
Hint :
Tags:
DP LCS
出處:
UVa10405


ID User Problem Subject Hit Post Date
沒有發現任何「解題報告」