10635 - Prince and Princess LCS&LIS
来源:互联网 发布:艾德纺织软件 编辑:程序博客网 时间:2024/04/29 01:21
Problem D
Prince and Princess
Input: Standard Input
Output: Standard Output
Time Limit: 3 Seconds
In an n x n chessboard, Prince and Princess plays a game. The squares in the chessboard are numbered 1, 2, 3 ... n*n, as shown below:
Prince stands in square 1, make p jumps and finally reach square n*n. He enters a square at most once. So if we use xp to denote the p-th square he enters, then x1, x2, ... xp+1 are all different. Note that x1 = 1 and xp+1 = n*n. Princess does the similar thing - stands in square 1, make q jumps and finally reach square n*n. We use y1, y2 , ... yq+1 to denote the sequence, and all q+1 numbers are different.
Figure 2 belows show a 3x3 square, a possible route for Prince and a different route for Princess.
The Prince moves along the sequence: 1 --> 7 --> 5 --> 4 --> 8 --> 3 --> 9 (Black arrows), while the Princess moves along this sequence: 1 --> 4 --> 3 --> 5 --> 6 --> 2 --> 8 --> 9 (White arrow).
The King -- their father, has just come. "Why move separately? You are brother and sister!" said the King, "Ignore some jumps and make sure that you're always together."
For example, if the Prince ignores his 2nd, 3rd, 6th jump, he'll follow the route: 1 --> 4 --> 8 --> 9. If the Princess ignores her 3rd, 4th, 5th, 6th jump, she'll follow the same route: 1 --> 4 --> 8 --> 9, (The common route is shown in figure 3) thus satisfies the King, shown above. The King wants to know the longest route they can move together, could you tell him?
Input
The first line of the input contains a single integer t(1 <= t <= 10), the number of test cases followed. For each case, the first line contains three integers n, p, q(2 <= n <= 250, 1 <= p, q < n*n). The second line contains p+1 different integers in the range [1..n*n], the sequence of the Prince. The third line contains q+1 different integers in the range [1..n*n], the sequence of the Princess.
Output
For each test case, print the case number and the length of longest route. Look at the output for sample input for details.
Sample Input Output for Sample Input
1
3 6 7
1 7 5 4 8 3 9
1 4 3 5 6 2 8 9
Case 1: 4
------------------------------
由于A序列中没有重复元素,对A重新编号为{1,2,3,4,5……}对B重新编号,编号表示B中bi元素出现的位置,则原序列的LCS就是新序列的LIS。O(nlogn)
------------------------------
#include <iostream>#include <cstdio>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;int N,p,q;const int OO=1e9;int a1[111111];int a2[111111];int c[111111];int a[111111];int g[111111];int d[111111];int main(){ int T,n; scanf("%d",&T); for (int cas=1;cas<=T;cas++) { scanf("%d%d%d",&N,&p,&q); memset(c,0,sizeof(c)); memset(g,0,sizeof(g)); n=0; for (int i=1;i<=p+1;i++) { scanf("%d",&a1[i]); c[a1[i]]=i; } for (int i=1;i<=q+1;i++) { scanf("%d",&a2[i]); if (c[a2[i]]) a[n++]=c[a2[i]]; } //LIS for (int i=0;i<=n;i++) g[i]=OO; int ans=0; for (int i=0;i<n;i++) { int k=lower_bound(g+1,g+n+1,a[i])-g; d[i]=k; g[k]=a[i]; ans=max(ans,d[i]); } printf("Case %d: %d\n",cas,ans); } return 0;}
- 10635 - Prince and Princess LCS&LIS
- UVA 10635 Prince and Princess lcs--》lis
- Uva - 10635 - Prince and Princess(LCS转LIS)
- UVA 10635 Prince and Princess (LCS优化转LIS)
- UVa 10635 Prince and Princess / LCS 转 LIS
- uva 10635 Prince and Princess (将LCS 转化为 LIS)
- uva 10635Prince and Princess (LCS转LIS)
- UVA 10635 - Prince and Princess LCS转化为LIS
- UVA 10635 - Prince and Princess (LCS转成LIS DP)
- UVA - 10635 Prince and Princess LCS转LIS
- UVA - 10635 - Prince and Princess (LCS转化为LIS)
- UVA 10635 - Prince and Princess ( LCS 转换为LIS )
- UVa 10635 - Prince and Princess(LCS转LIS)
- uva 10635-Prince and Princess 【LIS 求解 LCS】
- uva-10635 Prince and Princess LCS转化为LIS
- UVA 10635 Prince and Princess【LCS 问题转换为 LIS】
- 【UVA 10635】【LCS转化成LIS】 Prince and Princess
- UVA 10635 Prince and Princess(LCS转LIS)
- vbs进行正则表达式匹配的方法和需注意的问题
- eclipse工具的使用
- Android实现通用的ActivityGroup(效果类似Android微博客户端主界面),强烈建议不要再使用TabActivity
- 技术之美[程序人生]开博的感受、如何学习编程、学习方法总结
- php-fpm查找php慢速代码
- 10635 - Prince and Princess LCS&LIS
- test eax,eax
- 程序员读书雷达
- 自己做了个实用的PE
- 安装jprofiler 监控
- 问题七十七:等值首尾和。
- 数据库视图和索引
- NYOJ128 前缀式计算
- css布局视频