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: NLines 2…N+1: Line i+1 contains a single initial (‘A’…‘Z’) of the cow in the ith position in the original lineOutput
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
解题思路 设置两个初始值i,j分别赋值为0,n-1标记即将判断的左右两端的字符。 判断str[i]和str[j]的大小： 如果str[i]小，即输出str[i]，并且i++； 如果str[j]小，即输出str[j]，并且j++； 如果相等，即判断str[i+1]和str[j-1]的大小，然后决定输出str[i]或者str[j]；AC代码：
#include <iostream> #include <cstdio> using namespace std; #define MAXN 2010 char str[MAXN]; int main() { int n,num=0; while(cin >> n) { for(int i=0;i<n;i++) { cin >> str[i]; } int i=0,j=n-1; while(i<=j) { bool flag = false; for(int k=0;i+k<n;k++) { if(str[i+k]<str[j-k]) { flag = true; break; } else if(str[i+k]>str[j-k]) { flag = false; break; } } num++; if(flag) { cout << str[i++]; } else { cout << str[j--]; } if(num%80==0) cout << endl; } } cout << endl; return 0; }