UVa 10152 - ShellSort
来源:互联网 发布:网络主播幕后团队 编辑:程序博客网 时间:2024/05/17 20:47
Problem D: ShellSort
He made each turtle stand on another one's backAnd he piled them all up in a nine-turtle stack.
And then Yertle climbed up. He sat down on the pile.
What a wonderful view! He could see 'most a mile!
The Problem
King Yertle wishes to rearrange his turtle throne to place his highest-ranking nobles and closest advisors nearer to the top. A single operation is available to change the order of the turtles in the stack: a turtle can crawl out of its position in the stack and climb up over the other turtles to sit on the top.
Given an original ordering of a turtle stack and a required ordering for the same turtle stack, your job is to determine a minimal sequence of operations that rearranges the original stack into the required stack.
The first line of the input consists of a single integer K giving the number of test cases. Each test case consist on an integern giving the number of turtles in the stack. The next n lines specify the original ordering of the turtle stack. Each of the lines contains the name of a turtle, starting with the turtle on the top of the stack and working down to the turtle at the bottom of the stack. Turtles have unique names, each of which is a string of no more than eighty characters drawn from a character set consisting of the alphanumeric characters, the space character and the period (`.'). The nextn lines in the input gives the desired ordering of the stack, once again by naming turtles from top to bottom. Each test case consists of exactly 2n+1 lines in total. The number of turtles (n) will be less than or equal to two hundred.
For each test case, the output consists of a sequence of turtle names, one per line, indicating the order in which turtles are to leave their positions in the stack and crawl to the top. This sequence of operations should transform the original stack into the required stack and should be as short as possible. If more than one solution of shortest length is possible, any of the solutions may be reported. Print a blank line after each test case.
Sample Input
23YertleDuke of EarlSir LancelotDuke of EarlYertleSir Lancelot9YertleDuke of EarlSir LancelotElizabeth WindsorMichael EisnerRichard M. NixonMr. RogersFord PerfectMackYertleRichard M. NixonSir LancelotDuke of EarlElizabeth WindsorMichael EisnerMr. RogersFord PerfectMack
Sample Output
Duke of EarlSir LancelotRichard M. NixonYertle
#include <string.h>#include <stdio.h>int main(){ int k,n,c[205],i,j; char a[205][100],b[205][100]; scanf("%d",&k); while(k--) { scanf("%d",&n); getchar(); for(i=0;i<n;i++) gets(a[i]); for(j=0;j<n;j++) gets(b[j]); for(i=0;i<n;i++) for(j=0;j<n;j++) if(!strcmp(b[j],a[i])) { c[j]=i; break; } for(i=n-1;i>=0;i--) if(c[i]<c[i-1])break; for(i--;i>=0;i--) puts(b[i]); printf("\n"); } return 0;}
- uva 10152 shellsort
- Uva 10152 ShellSort
- uva 10152 - ShellSort
- UVa 10152 - ShellSort
- uva-10152 - ShellSort
- UVa 10152 - ShellSort
- uva 10152 - ShellSort
- 数据结构 uva-10152 - ShellSort
- UVa 10152 - ShellSort
- UVa 10152 - ShellSort
- uva 10152ShellSort
- uva 10152 ShellSort
- UVa 10152 - ShellSort
- uva 10152 ShellSort
- uva 10152 ShellSort
- UVa 10152 ShellSort
- uva 10152 ShellSort
- uva 10152 - ShellSort
- matlab画图:绘制双图,上图以条形图(分割开来的两根bar),下图是残差。。。横坐标为日期
- 解决load,get,save 等is not valid without active transaction异常的原因。
- ArcGIS Runtime支持的GP工具列表(转 )
- 老板不在时为老板处理一些事务
- Android设置对话框风格的Activity
- UVa 10152 - ShellSort
- 堆和栈
- windows 2003 设置或更改管理员密码
- 剩余电量测量
- dup,dup2函数的用法
- DNS代理
- deflate and inflate simple demo (ZipInputStream/ZipOutputStream)
- opencv 轮廓的凸包,凸缺陷
- 如何向领导汇报工作(5)