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.
* 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
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.
6 A C D B C B
ABCBCD
题意:给一个长度为N的字符串S,有两种操作:一是将S的头部删除一个字符加到新字符串S1的尾部,二是从S的尾部删除一个字符,加到S1的尾部,输出构造出的字典序最小的字符串S1。
有人说这是贪心,我感觉这更像一道模拟题,不得不说英文题对中国学生很不友好,就这种水题要读这么多英文,其实有时候我们之所以打比赛,发挥不出来该有的水平,大半是因为语言不通的问题。
#include <stdio.h> int main() { int N; char c[2005]; scanf("%d",&N); for(int i = 0; i < N; i++) { getchar(); scanf("%c",&c[i]); } int l = 0, r = N-1, t = 0; while(l <= r) { t++; int k = 0; for(int i = 0; l+i <= r; i++) { if(c[l+i] < c[r-i]) { k = 1; break; } else if(c[l+i] > c[r-i]) { k = 0; break; } } if(k) putchar(c[l++]); else putchar(c[r--]); if(t % 80 == 0) { printf("\n"); } } return 0; }