hdoj-5904 LCIS

原题链接

LCIS

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 444    Accepted Submission(s): 203

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
  
  

用map不然会超时

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map> 
#define maxn 100005
#define MOD 1000000007
#define INF 1e9
using namespace std;
typedef long long ll;

int num1[100005], num2[100005];
map<int, int> dp1, dp2;
int main(){
    
//    freopen("in.txt", "r", stdin);
    int t;
    
    scanf("%d", &t);
    while(t--){
        
        dp1.clear();
        dp2.clear();
        int n, m;
        
        scanf("%d%d", &n, &m);
        for(int i = 0; i < n; i++)
         scanf("%d", num1+i);
        for(int i = 0; i < m; i++)
         scanf("%d", num2+i);
        for(int i = n-1; i >= 0; i--){
            dp1[num1[i]] = dp1[num1[i]+1] + 1;
        }
        for(int i = m-1; i >= 0; i--){
            dp2[num2[i]] = dp2[num2[i]+1] + 1;
        }
        int maxs = 0;
        map<int, int> ::iterator iter = dp1.begin();
        for(; iter != dp1.end(); iter++){
            maxs = max(maxs, min(iter->second, dp2[iter->first]));
        }
        printf("%d\n", maxs);
    }
    return 0;
}