POJ1382(贪心)
Best Cow Line
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
题意
给定长度为N的字符串S,构造一个长度为N的字符串T,起初T是一个空字符串。反复进行如下任意操作:
- 从S头部删除一个字符,添加到T的尾部;
- 从S尾部删除一个字符,添加到T的尾部。
目标为构造字典序尽可能小的字符串T。
思路
每次比较序列首部和尾部,取出较小的一个,如果相等就继续往下比较,直到大小出现差异或者比较变量相遇。
代码
public class BestCowLine {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
char[] s = new char[n];
for (int i = 0; i < n; i++) {
s[i] = sc.next().charAt(0);
}
int head = 0;
int tail = n - 1;
int count = 0;
while (head <= tail) {
boolean left = false;
for (int i = 0; head + i < tail; i++) {
if (s[head + i] < s[tail - i]) {
left = true;
break;
} else if (s[head + i] > s[tail - i]) {
left = false;
break;
}
}
if (left) {
System.out.print(s[head++]);
count++;
} else {
System.out.print(s[tail--]);
count++;
}
if (count % 80 == 0) {
System.out.println();
}
}
System.out.println();
}
}