Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 25475 | Accepted: 6947 |
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<iostream>
#include<cstdio>
using namespace std;
int n;
char s[2005];
int main(){
cin >> n;
for(int i = 0 ; i < n; i++){
cin >> s[i];
}
int l, r;
l = 0; r = n-1;
int num = 0;
while(l <= r){
bool left = false;
for(int i = 0; i <= (r - l) / 2; i++){
if(s[l+i] < s[r-i]) {left = true; break;}
else if(s[l+i] > s[r-i]) {left = false; break;}
}
if(left) putchar(s[l++]);
else putchar(s[r--]);
num++;
if(num % 80 == 0) putchar('\n');
}
}