UVA 10635
来源:互联网 发布:聚类算法哪几种 编辑:程序博客网 时间:2024/06/18 08:44
Submit Status
Description
Problem E
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: Man Rujia Liu Man, Member of Elite Problemsetters' Panel
Pictures drawn by Shahriar Manzoor, Member of Elite Problemsetters' Panel
题意:白书例题,让我们求a和b的最长公共子序列。
#include <iostream>#include <cstdio>#include <climits>#include <cstring>#include <cstdlib>#include <cmath>#include <vector>#include <queue>#include<map>#include <algorithm>#include<ctime>#define esp 1e-6#define LL unsigned long long#define inf 0x0f0f0f0fusing namespace std;int a,b[250*250],c[250*250];int num[250*250];int main(){ int t; int n,p,q; int bb; int i,j,cas; scanf("%d",&t); for(cas=1;cas<=t;cas++) { memset(num,0,sizeof(num)); scanf("%d%d%d",&n,&p,&q); for(i=1;i<=p+1;i++) { scanf("%d",&a); num[a]=i; } for(i=1;i<=q+1;i++) { scanf("%d",&bb); b[i]=num[bb]; } c[1]=b[1]; int l,r,m,ans; ans=1; for(i=2;i<=q+1;i++) { l=1; r=ans; while(l<=r) { m=(l+r)/2; if(c[m]<b[i]) l=m+1; else r=m-1; } c[l]=b[i]; if(l>ans) ans++; } printf("Case %d: %d\n",cas,ans); }}
- uva--10635
- UVa 10635
- UVA 10635
- UVA 10635
- uva 10635
- uva 10635 nlogn LIS
- Uva 10635 简单dp
- UVA 10635 LIS
- dp 专题系列(一)(UVa 10635,UVa 11825,UVa 10859,Uva LiveArchive 3882 )
- uva
- UVA
- UVA
- UVA
- uva
- UVA
- UVA
- UVA
- UVA
- ResultSetExtractor 的小demo
- 海明码
- 3年前 --- 记自己成为程序员的旅程
- 第九周项目6(2)
- Unable to execute dex: Multiple dex files define
- UVA 10635
- 软工实验第六周任务
- 【二分图】专题
- 【智能家居篇】wifi网络接入原理(中)——认证Authentication
- BZOJ 2301: [HAOI2011]Problem b
- 文件的基本操作
- Java面向对象基础二
- 【bzoj 2173】: 整数的lqp拆分
- linux系统安装增强功能与集群网络配置