uva 10635Prince and Princess (LCS转LIS)
来源:互联网 发布:电脑没网络wifi没网络 编辑:程序博客网 时间:2024/04/24 05:16
Description
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
Problemsetter: Rujia Liu, Member of Elite Problemsetters' Panel
Pictures drawn by Shahriar Manzoor, Member of Elite Problemsetters' Panel
#include<iostream>#include<cstdio>#include<map>#include<cstring>using namespace std;const int maxn=100000;map<int,int> mq;int a[maxn];int main(){ int tes,cas; cin>>tes; int n,p,q; int i,x; for(cas=1;cas<=tes;cas++) { mq.clear(); cin>>n>>p>>q; p++,q++; for(i=1;i<=p;i++) { scanf("%d",&x); mq[x]=i; } for(i=1;i<=1e5-1;i++) a[i]=1e5; for(i=1;i<=q;i++) { scanf("%d",&x); if(mq[x]) { x=mq[x]; int l,r,mid; l=0,r=n*n; while(r>l+1) //一定介于l与r之间 { mid=(r+l)>>1; if(a[mid]<x) l=mid; else r=mid; } a[l+1]=x; } } int res; for(i=n*n;i>=1;i--) if(a[i]<=n*n) { res=i; break; } printf("Case %d: %d\n",cas,res); } return 0;}/*33 6 71 7 5 4 8 3 91 4 3 5 6 2 8 93 8 81 2 3 4 5 6 7 8 91 2 3 4 5 6 7 8 9*/
- 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)
- 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 DP)
- 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
- 位运算-用位与&运算符判断变量是奇数,偶数
- 读书笔记 - 妈妈要懂的淘气孩子心理学 -
- cocos2d-x win32 移植android问题集锦
- selenium2如何设置firefox的UA
- 关于Wince部署时无图标的问题
- uva 10635Prince and Princess (LCS转LIS)
- 0036 java NIO ServerSocketChannel原理(一)【底层】
- LeetCode OJ:Symmetric Tree
- 几种常见的DIV边框样式 和 边框宽度、颜色
- MFC ListBox控件小记(添加记录和获取记录)
- 强大的任务管理器-Process Hacker
- 手机丢失实验叫板支付宝 揭秘小米官网怎么抢手机
- Lua基础学习——关系运算符
- 内存对齐的规则以及作用