LCIS

Problem Description

Alex has two sequences a_1,a_2,...,a_na​1​​,a​2​​,...,a​n​​ and b_1,b_2,...,b_mb​1​​,b​2​​,...,b​m​​. He wants find a longest common subsequence that consists of consecutive values in increasing order.

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 two integers $n$ and $m$ $(1\le n,m\le 100000)$ -- the length of two sequences. The second line contains $n$ integers: a_1, a_2, ..., a_na​1​​,a​2​​,...,a​n​​ (1 \le a_i \le 10^6)(1≤a​i​​≤10​6​​). The third line contains $n$ integers: b_1, b_2, ..., b_mb​1​​,b​2​​,...,b​m​​ (1 \le b_i \le 10^6)(1≤b​i​​≤10​6​​).

There are at most $1000$ test cases and the sum of $n$ and $m$ does not exceed 2 \times 10^62×10​6​​.

Output

For each test case, output the length of longest common subsequence that consists of consecutive values in increasing order.

Sample Input

Copy

33 31 2 33 2 110 51 23 2 32 4 3 4 5 6 11 2 3 4 51 121

Sample Output

150

#include<iostream>#include<cstring>using namespace std;const int maxn=100000+10;int main(){    int t;    int maxlen[maxn];    int a[maxn],b[maxn];    cin>>t;    int n,m;    while(t--)    {        memset(maxlen,0,sizeof(maxlen));        cin>>n>>m;        for(int i=1;i<=n;i++)            cin>>a[i];        for(int i=1;i<=m;i++)            cin>>b[i];            for(int i=1;i<=n;i++)                for(int j=1,temp=0;j<=m;j++)            {                if(a[i]>b[j]&&maxlen[j]>temp)                    temp=maxlen[j];                else if(a[i]==b[j])                    maxlen[j]=temp+1;            }            int max=0;            for(int i=1;i<=m;i++)                if(max<maxlen[i])                max=maxlen[i];            cout<<max<<endl;    }}