HDU 5495 LCS

Problem Description

You are given two sequence {a_1, a_2, ..., a_n}{a​1​​,a​2​​,...,a​n​​} and {b_1,b_2, ... ,b_n}{b​1​​,b​2​​,...,b​n​​}. Both sequences are permutation of $\{1,2,...,n\}$. You are going to find another permutation {p_1,p_2,...,p_n}{p​1​​,p​2​​,...,p​n​​} such that the length of LCS (longest common subsequence) of {a_{p_1},a_{p_2},...,a_{p_n}}{a​p​1​​​​,a​p​2​​​​,...,a​p​n​​​​} and {b_{p_1},b_{p_2},...,b_{p_n}}{b​p​1​​​​,b​p​2​​​​,...,b​p​n​​​​} is maximum.

Input

There are multiple test cases. The first line of input contains an integer $T$, indicating the number of test cases. For each test case:

The first line contains an integer n (1 \le n \le 10^5)n(1≤n≤10​5​​) - the length of the permutation. The second line contains $n$ integers a_1,a_2,...,a_na​1​​,a​2​​,...,a​n​​. The third line contains $n$ integers b_1,b_2,...,b_nb​1​​,b​2​​,...,b​n​​.

The sum of $n$ in the test cases will not exceed 2 \times 10^62×10​6​​.

Output

For each test case, output the maximum length of LCS.

Sample Input

231 2 33 2 161 5 3 2 6 43 6 2 4 5 1

Sample Output

2
4
找到循环个数即可
#include<cstdio>#include<cstring>#include<cmath>#include<string>#include<algorithm>#include<iostream>using namespace std;typedef long long LL;const int maxn = 300005;const LL base = 1e9 + 7;int T, n, m, a[maxn], b[maxn], f[maxn], ans;int main(){    while (cin >> T)    {        while (T--)        {            scanf("%d", &n);    ans = 0;            for (int i = 1; i <= n; i++) scanf("%d", &a[i]);            for (int i = 1; i <= n; i++) scanf("%d", &b[i]);            for (int i = 1; i <= n; i++) f[a[i]] = b[i];            for (int i = 1; i <= n; i++)            if (f[i])            {                if (f[i] == i) { ans++; continue; }                for (int j = f[i], k = j; j != i; )                {                    k = j;                    ans++;                    j = f[j];                    f[k] = 0;                }                f[i] = 0;            }            printf("%d\n", ans);        }    }    return 0;}