Submit | All submissions | Best solutions | Back to list |
XMEN - X-MEN |
Dr. Charles Xavier is trying to check the correlation between the DNA samples of Magneto and Wolverine. Both the DNAs are of length N, and can be described by using all integers between 1 to N exactly once. The correlation between two DNAs is defined as the Longest Common Subsequence of both the DNAs.
Help Dr. Xavier find the correlation between the two DNAs.
Input
First line of input contains number of test cases T. Each test case starts with an integer N, size of DNA. The next two lines contains N integers each, first line depicting the sequence of Magneto's DNA and second line depicting Wolverine's DNA.
Output
For each test case print one integer, the correlation between the two DNAs.
Example
Input: 2 2 1 2 2 1 3 1 2 3 1 3 2 Output: 1 2
Constraints
1 ≤ T ≤ 10
1 ≤ N ≤ 100000
Added by: | smit hinsu |
Date: | 2013-02-18 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | CodeCraft 13 , Author : Nadeem Moidu |
hide comments
|
|||||
2017-10-13 03:20:53
Nice problem to practice n lg n LIS. Thank you. What's the number of this problem? Last edit: 2017-10-13 04:04:18 |
|||||
2017-09-10 16:39:01
nice problem! MAP[a[i]] = i; b[j] = MAP[b[j]]; LIS of b[] is the ans Last edit: 2017-09-10 16:39:16 |
|||||
2016-12-27 14:15:05
it is constantly throwing runtime error i don't know why pls any suggestion |
|||||
2016-08-16 22:29:30 Anuj Arora
100th |
|||||
2016-02-11 21:34:24 Archit Gupta
can someone clarify how mapping guarantees the optimal solution ? |
|||||
2015-09-06 20:17:55 anando_du
nlogk solution is acceptable ... This problem is not LCS .. It's actually a LIS problem .. All u need to do , u just need to convert it into a lis problem .. (Converting is not too much difficult . just think one DNA as index and other DNA as element , now map them ) |
|||||
2015-08-31 17:55:50
nlogn |
|||||
2015-07-17 19:46:59 Gohan
The O(n^2) Dynamic Programming solution gave TLE. What is the expected time complexity? |
|||||
2015-05-16 00:30:22 Naman Goyal
The problem statement doesn't clear if it's LCS between digits or each number is considered as individual symbol? |
|||||
2015-01-26 08:25:11 saumya
Longest Common/ Increasing Subsequence ( DP ) Last edit: 2015-01-26 08:34:05 |