Alex has two sequences a_1,a_2,...,a_na1,a2,...,an and b_1,b_2,...,b_mb1,b2,...,bm. He wants find a longest common subsequence that consists of consecutive values in increasing order.
There are multiple test cases. The first line of input contains an integer TT, indicating the number of test cases. For each test case:
The first line contains two integers nn and mm (1 \le n, m \le 100000)(1≤n,m≤100000) -- the length of two sequences. The second line contains nn integers: a_1, a_2, ..., a_na1,a2,...,an (1 \le a_i \le 10^6)(1≤ai≤106). The third line contains nn integers: b_1, b_2, ..., b_mb1,b2,...,bm (1 \le b_i \le 10^6)(1≤bi≤106).
There are at most 10001000 test cases and the sum of nn and mm does not exceed 2 \times 10^62×106.
For each test case, output the length of longest common subsequence that consists of consecutive values in increasing order.
3 3 3 1 2 3 3 2 1 10 5 1 23 2 32 4 3 4 5 6 1 1 2 3 4 5 1 1 2 1
1 5 0
#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;
}
}
和sleep区别)
