18587번 - Nonsense Time 다국어

You a given a permutation p₁, p₂, . . . , p_n of size n. Initially, all elements in p are frozen. There will be n stages that these elements will become available one by one. On stage i, the element p_ki will become available.

For each i, find the longest increasing subsequence among available elements after the first i stages.

The first line of the input contains an integer T (1 ≤ T ≤ 3), denoting the number of test cases.

In each test case, there is one integer n (1 ≤ n ≤ 50 000) on the first line, denoting the size of permutation.

In the second line of each test case, there are n distinct integers p₁, p₂, . . . , p_n (1 ≤ p_i ≤ n), denoting the permutation.

In the third line of each test case, there are n distinct integers k₁, k₂, . . . , k_n (1 ≤ ki ≤ n), describing each stage.

It is guaranteed that p₁, p₂, . . . , p_n and k₁, k₂, . . . , k_n are generated uniformly at random among all possible permutations of the given size.

For each test case, print a single line containing n integers, where the i-th integer denotes the length of the longest increasing subsequence among available elements after the first i stages.