Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 22975 | Accepted: 6261 |
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
大致题意:
给出一个字符串,每次取出它的第一个元素或最后一个元素,加入一个新的字符串的末尾。并使原字符串所有元素都移到新串中时,新串的字典序最小。
大体思路:
就是贪心。每次比较原串首尾两元素的大小,取小的插入新串的末尾。问题是,首尾两个元素相等时怎么办。
因为要求最终得到的新串字典序最小,所以不能任意取一个,而要考虑第二和倒数第二个元素。如果这两个元素也相等,那就继续考虑他们各自的下一个元素。
#include<cstdio>
#include<iostream>
using namespace std;
#define limit 2010
int Line [limit];
int N;
int main ()
{
scanf("%d", &N);
for(int i=1; i<=N; i++)
scanf(" %c", Line+i);
int i = 1, j = N, cnt = 0;
while(i<=j){
bool flag = true;
for(int k=0; i+k<=j; k++){
if(Line[i+k] < Line[j-k]){
flag = true;
break;
}
if(Line[i+k] > Line[j-k]){
flag = false;
break;
}
}
if(flag) printf("%c",Line[i++]);
else printf("%c",Line[j--]);
cnt++;
if(!(cnt%80) ) printf("\n");
}
return 0;
}