UVA - 10152 ShellSort

Problem D: ShellSort

He made each turtle stand on another one's back
And 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 integer n 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 next n 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

2
3
Yertle
Duke of Earl
Sir Lancelot
Duke of Earl
Yertle
Sir Lancelot
9
Yertle
Duke of Earl
Sir Lancelot
Elizabeth Windsor
Michael Eisner
Richard M. Nixon
Mr. Rogers
Ford Perfect
Mack
Yertle
Richard M. Nixon
Sir Lancelot
Duke of Earl
Elizabeth Windsor
Michael Eisner
Mr. Rogers
Ford Perfect
Mack

Sample Output

Duke of Earl

Sir Lancelot
Richard M. Nixon
Yertle


题意：
这个算法用到了“相对位置”的思想，假设移动了k个元素，那么这k个元素一定是最后结果的那个序列的
前k个元素，而且易知，越先移动的元素一定会越被压在移动的元素的底部    
首先找到需要移动的字符串，方法如下：以初始序列为准，设初始序列下标为i, 目的序列下标为j, 从n-1开始，如
果两下标对应的字符串相等，下标同时减一，否则仅初始序列下标减一。那么目的序列中还未被成功匹配的字符串就
是需要移动的字符串。要使移动次数最少，显然应该按未被处理的目的序列中字符串逆序移动（输出）。
#include<iostream>
#include<cstring>
#include<cstdio>
#define N 400
using namespace std;

int main(){
	int n;
	cin >> n;
	while(n --)
	{
		char a[N][N];
		char b[N][N];
		int m;

		cin >> m;
		getchar();
		for(int i = 0; i < m; i++)
			gets(a[i]);
		for(int i  = 0; i < m; i++)
			gets(b[i]);

		int x = m -1 ;
		int y = m -1;
		for( x = m - 1, y = m -1; x >= 0; x --)
		{
			if(strcmp(a[x],b[y]) == 0 )
				y --;

		}
		while(y>=0)
			puts(b[y --]);
		printf("\n");

	}
	return 0;
}