Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 26954 | Accepted: 7284 |
Description
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
题意:给你一个字符串,每次都可以从首或尾拿一个字符出来加入到一个新的字符串的串首,问怎么加使字典序最小。输出每80个字符换行。
很显然,我们比较旧字符串的队首和队尾,哪个小我们就先把哪个加进来,如果一样,那就比它的下一位直到不一样。如果一直一样,那加哪个都无所谓了。
#include<cstdio>
char s[5000];
int n,tot=0;
void work()
{
int a=0,b=n-1;
while(a<=b)
{
bool left=false;
for (int i=0;a+i<=b;i++)
{
if (s[a+i]<s[b-i]){ left=true;break; }
if (s[a+i]>s[b-i]){ left=false;break; }//如果都一样就继续
}
if (left) putchar(s[a++]);
else putchar(s[b--]);
if((++tot)%80==0) putchar('\n');//每80个字符换行
}
putchar('\n');
}
int main()
{
scanf("%d",&n);
for (int i=0;i<n;i++) scanf("%s",&s[i]);
work();
return 0;
}