LCIS
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 400 Accepted Submission(s): 182
Problem Description
Alex has two sequences
a1,a2,...,an
and
b1,b2,...,bm
. 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≤n,m≤100000) -- the length of two sequences. The second line contains n integers: a1,a2,...,an (1≤ai≤106) . The third line contains n integers: b1,b2,...,bm (1≤bi≤106) .
There are at most 1000 test cases and the sum of n and m does not exceed 2×106 .
The first line contains two integers n and m (1≤n,m≤100000) -- the length of two sequences. The second line contains n integers: a1,a2,...,an (1≤ai≤106) . The third line contains n integers: b1,b2,...,bm (1≤bi≤106) .
There are at most 1000 test cases and the sum of n and m does not exceed 2×106 .
Output
For each test case, output the length of longest common subsequence that consists of consecutive values in increasing order.
Sample Input
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
Sample Output
1 5 0
Source
Recommend
这道题最重要的一点是最长递增公共子序列是连续的
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[200000+10],b[200000+10];
int main()
{
int t,n,m,i,j,k,x,y;
scanf("%d",&t);
while(t--)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
a[x]=a[x-1]+1;
}
int ans=0;
for(i=1;i<=m;i++)
{
scanf("%d",&x);
b[x]=b[x-1]+1;
ans=max(ans,min(a[x],b[x]));
}
printf("%d\n",ans);
}
return 0;
}