首页 > 试题广场 >

Longest Common Subsequence

[编程题]Longest Common Subsequence
Niuniu has recently learned LCS(Longest Common Subsequence) of two sequences.
Now he wants to know the LCS of four sequences.
Given 4 sequences {ai}, {bi}, {ci}, {di}.
Please find the longest common subsequence.

输入描述:
The first line contains one integer, which is n.
The second line contains n integers, which is the sequence {ai}.
The third line contains n integers, which is the sequence {bi}.
The fourth line contains n integers, which is the sequence {ci}.
The fifth line contains n integers, which is the sequence {di}.

1 <= n <= 10000
1 <= ai <= n
Any number appears in {ai} at most 2 times.
1 <= bi <= n
Any number appears in {bi} at most 2 times.
1 <= ci <= n
Any number appears in {ci} at most 2 times.
1 <= di <= n


输出描述:
You should output one integer, which is the length of the LCS.
示例1

输入

5
1 2 1 2 3
1 2 3 1 2
3 1 2 1 2
1 2 1 2 1

输出

4
算法知识视频讲解
添加回答

这道题你会答吗？花几分钟告诉大家答案吧！

提交观点

问题信息

分治 KD Tree
难度：
0条回答 6浏览

热门推荐

通过挑战的用户

查看代码

相关试题

Longest Common Subsequence

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号