Best Cow Line, Gold OpenJ_Bailian - 3377

题目：

FJ is about to take his N (1 <= N <= 30,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 (e.g., 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 (i.e., alphabetical 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 lineOutputThe least lexicographic string he can make. Every line (except perhaps the last one) contains the initials of 80 cows ('A'..'Z') in the newline.Sample Input

6
A
C
D
B
C
B

Sample Output

ABCBCD

题意很简单，给出数列，每次取出两端的一个字符，求能得到的最小字典序字符串。

贪心即可。

代码：

#include
using namespace std;

int main()
{
	int n;
	cin >> n;
	char s[30001];
	for (int i = 1; i <= n; i++)cin >> s[i];
	int left = 1, right = n, l, r;
	n = 0;
	while (left <= right)
	{
		l = left, r = right;
		while (s[l] == s[r] && l < r - 1)l++, r--;
		if (s[l] < s[r])cout << s[left++];
		else cout << s[right--];
		n++;
		if (n % 80 == 0)cout << endl;
	}
	return 0;
}