挑战上的POJ-3617题解

题目：Best Cow Line

FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"Farmer of the Year" competition. In this contest every farmer arranges his cows in a line and herds them past the judges.

The contest organizers adopted a new registration scheme this year: simply register the initial letter of every cow in the order they will appear (i.e., If FJ takes Bessie, Sylvia, and Dora in that order he just registers BSD). After the registration phase ends, every group is judged in increasing lexicographic order according to the string of the initials of the cows' names.

FJ is very busy this year and has to hurry back to his farm, so he wants to be judged as early as possible. He decides to rearrange his cows, who have already lined up, before registering them.

FJ marks a location for a new line of the competing cows. He then proceeds to marshal the cows from the old line to the new one by repeatedly sending either the first or last cow in the (remainder of the) original line to the end of the new line. When he's finished, FJ takes his cows for registration in this new order.

Given the initial order of his cows, determine the least lexicographic string of initials he can make this way.

Input

* Line 1: A single integer: N
* Lines 2..N+1: Line i+1 contains a single initial ('A'..'Z') of the cow in the ith position in the original line

Output

The least lexicographic string he can make. Every line (except perhaps the last one) contains the initials of 80 cows ('A'..'Z') in the new line.

Sample Input

6
A
C
D
B
C
B

Sample Output

ABCBCD

刚开始纠结于两边一次次比较并选择的话，遇到相同的字符怎么办？

书上的解决办法便是用一个布尔变量判断选头还是选尾，遇到相同的直接跳过，直到可以判断头和尾的大小为止，然后用“头++”或“尾--”的方式将选中的字符排出本列。代码如下：

#include<iostream>
using namespace std;
int main()
{
	int n;
	char s[2001];
	cin>>n;
	for(int i=0;i<n;i++)
		getchar(),cin>>s[i];
	int a=0,b=n-1,count=0;
	while(a<=b)
	{
		bool left=false;//此处通过一个判定和每次新字符串回文重搜，巧妙避开了对位相等如何取舍的问题 
		for(int i=0;i<=b-a;i++)
			if(s[a+i]<s[b-i])
			{
				left=true;
				break;
			}
			else if(s[a+i]>s[b-i])
				break;
		if(left)
			putchar(s[a++]);
		else
			putchar(s[b--]);
		count++;
		if(count%80==0)
			cout<<endl;
	}
	return 0;
}