http://poj.org/problem?id=3617
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
题目大意:给你含有n个大写字母的字符串,让你构成一个新的字符串,其字典序最小,但是每次只能从原字符串的头或尾选取一个字符加入到新字符串的末尾。
思路:每次比较原字符串的第一个字符和最后一个字符,选取二者之间较小的那个放到新串的后面,如果相等,则从两边向内继续比较。
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<deque>
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
string t;
int cmp(int l,int r);
int main()
{
int n;
scanf("%d",&n);
char ch;
for(int i=0;i<n;i++)
{
cin>>ch;
t+=ch;
}
string s;
int i=0;
int j=t.size()-1;
while(i<=j)
{
if(cmp(i,j))
s+=t[i++];
else
s+=t[j--];
}
for(int i=0;i<s.size();i++)
{
printf("%c",s[i]);
if((i+1)%80==0)
printf("\n");
}
return 0;
}
int cmp(int l,int r)
{
for(int i=l,j=r;i<j;i++,j--)
{
if(t[i]<t[j])
return 1;
else if(t[i]>t[j])
return 0;
else
continue;
}
return 1;
}