【HDU 5904 LCIS + dp】
来源:互联网 发布:手机桌面整理软件 编辑:程序博客网 时间:2024/06/05 19:27
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
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int KL = 1000011;int pa1[KL],pa2[KL];int dp1[KL],dp2[KL];int main(){ int i,j,N,T,n,m,ans; scanf("%d",&T); while(T--) { ans = 0; scanf("%d%d",&n,&m); for(i = 1 ; i <= n ; i++){ scanf("%d",&pa1[i]); dp1[pa1[i]] = max(dp1[pa1[i]], dp1[pa1[i] - 1] + 1); } for(i = 1 ; i <= m ; i++){ scanf("%d",&pa2[i]); dp2[pa2[i]] = max(dp2[pa2[i]],dp2[pa2[i] - 1] + 1); } for(i = 1 ; i <= n ; i++){ ans = max(ans,min(dp1[pa1[i]] , dp2[pa1[i]])); dp1[pa1[i]] = 0; } for(i = 1 ; i <= m ; i++) dp2[pa2[i]] = 0; printf("%d\n",ans); } return 0 ;}
- 【HDU 5904 LCIS + dp】
- HDU-5904 LCIS(dp)
- HDU 5904 LCIS (DP)
- HDU 5904 LCIS (dp)
- hdu 5904 LCIS【dp】
- HDU 5904 LCIS __ dp、LCIS
- hdu 5904 LCIS(简单dp)
- HDU 5904 LCIS(dp)
- HDU --- 5904 LCIS 【思维 + 简单dp】
- Hdu 1904 LCIS (dp)
- HDU 5904:LCIS(LCIS)
- 【14.06%】【hdu 5904】LCIS
- HDU 5904 - LCIS
- HDU-5904-LCIS
- hdu 5904 LCIS
- HDOJ 5904 LCIS (dp)
- 思维 hdu 5904 (LCIS)
- HDU 5904 LCIS (动态规划) -- 解题报告
- HTML+CSS基础 form标签method属性为get是什么行为
- 20160924 - 如何成为一个厉害的人
- StringTokenizer类的使用方法
- Android学习之路------自定义控件,圆形进度条的简单实现
- luasocket 之 udp
- 【HDU 5904 LCIS + dp】
- hihoCoder 1391 Countries 【预处理+排序+堆】 (ACM-ICPC国际大学生程序设计竞赛北京赛区(2016)网络赛)
- sql优化
- HTML+CSS基础 form中的input的type属性password,创建一个可以输入密码的文本框
- 素数
- 可重入函数与不可重入函数
- 网络编程
- Leetcode 01 Two Sum
- iOS-获取当前View所在的控制器