hdu5904 BestCoder Round #87 LCIS -dp

LCIS

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 .

 

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

BestCoder Round #87

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:  5906 5905 5903 5902 5901 

 

题意

找a和b的最长公共上升子序列 并且这个子序列的值是递增的

解题思路

f分别用数组a，b表示以i为结尾的最长LCIS的长度，然后遍历一次，在满足a【i】==b【i】的前提下更新ans

或者 取max（ans，min（a[i],b[i]））一样

代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxn = 200000;
int a[maxn+5];//1串的桶,表示以i为结尾的最长LCIS的长度
int b[maxn+5];//2串的桶

int main()
{
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, m,t;
        scanf("%d%d", &n, &m);

        memset(a, 0, sizeof(a));
        memset(b, 0, sizeof(b));
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &t);
             a[t] = a[t-1] + 1;
        }
        for (int i = 0; i < m; i++)
        {
            scanf("%d", &t);
            b[t] = b[t-1] + 1;
        }

        int ans = -1;
        int mmin;
        for (int i = 0; i <maxn; i++) {
            mmin=min(a[i], b[i]);
            ans = max(ans, mmin);
        }
        printf("%d\n", ans);

    }
    return 0;
}