Longest Common Subsequence

View as PDF

Points: 7
Time limit: 1.0s
Memory limit: 256M

Author:
Problem type

Solve the Longest Common Subsequence problem.

Input Specification

Line 1:

Line 2: nonnegative integers , the first sequence.

Line 3: nonnegative integers , the second sequence.

Output Specification

Line 1: The length of the LCS of the first and second sequences.

Sample Input

5 3
1 4 3 4 2
2 1 3

Sample Output

2

• commented on June 19, 2015, 3:32 p.m. edited

This comment is hidden due to too much negative feedback. Show it anyway.

• commented on June 19, 2015, 4:04 p.m. edited

The test case can have multiple digit numbers you know

print(input()) gives

9 1 1 0 2 3 10 3 0

not

9 1 1 0 2 3 1 0 3 0