Best Cow Line

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

*这题主要是用贪心，目标主要是从已知的字符串构造出字典序尽可能小的字符串
*从字典序性质来看，无论字符串末尾有多大，只要保证前面部分较小就可以咯！
*假设原来字符串为S，目标字符串为T，那么，不断取出S的开头和末尾较小的一个
*字符放到T的末尾。上面的没有针对开头与结尾相同，如果，遇到这样动情况，应
*该比较下一个字符的大小。如果，下一个字符也相同，那么可以得到下面的算法：
*按照字典序比较S和将S反转后的字符串S’
*如果，S较小，那么取出S开头字符，追加到T的末尾
*如果，S'较小，那么取出S结尾字符，追加到T的末尾
*如果，相同则取出那一个都可以。

#include <iostream>
#include <stdio.h>
using namespace std;
int n;
char s[2100];int main()
{scanf("%d",&n);int cnt=0;char temp[2];while(cnt<n){scanf("%s",temp);s[cnt++]=temp[0];}int f=0,e=n-1,cnt0=0;while(f <= e)   // 将从左起和从右起的字符串比较{bool flag = false;for(int i = 0; i <= e - f; i++)  // 字符串的开头与结尾相同，则继续比较下一个{if(s[f+i] < s[e-i]){flag = true;cnt0++;break;}else if(s[f+i] > s[e-i]){flag = false;cnt0++;break;}}if(flag) cout<<s[f++];else cout<<s[e--];if(cnt0 % 80 == 0)cout<<endl;}cout  << endl;//cout << "Hello world!" << endl;return 0;
}

Best Cow Line相关推荐

贪心 POJ - 3617 Best Cow Line
Best Cow Line POJ - 3617 FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"Farmer of ...
P2870 [USACO07DEC]最佳牛线，黄金Best Cow Line, Gold（加强版)(贪心+hash哈希）
P2870 [USACO07DEC]最佳牛线,黄金Best Cow Line, Gold(加强版)(贪心+hash哈希) 洛谷上这道水题丧心病狂地把数据范围加到了500000 普通的做法肯定A不了了, ...
【BZOJ】3301: [USACO2011 Feb] Cow Line（康托展开）
http://www.lydsy.com/JudgeOnline/problem.php?id=3301 其实这一题很早就a过了,但是那时候看题解写完也是似懂非懂的.... 听zyf神犇说是康托展开, ...
POJ 3617 Best Cow Line 贪心算法
Best Cow Line Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26670 Accepted: 7226 Descri ...
POJ 3617 Best Cow Line（最佳奶牛队伍）
POJ 3617 Best Cow Line Time Limit: 1000MS Memory Limit: 65536K [Description] [题目描述] FJ is about to t ...
P2870 [USACO07DEC]Best Cow Line G
P2870 [USACO07DEC]Best Cow Line G 题意: 给你一个字符串,每次从首或尾取一个字符组成字符串,问所有能够组成的字符串中字典序最小的一个. 题解: 现在要组成字典序最小的 ...
Cow Line（洛谷-P3014）
题目描述 The N (1 <= N <= 20) cows conveniently numbered 1...N are playing yet another one of thei ...
【BZOJ】【3301】【USACO2011 Feb】Cow Line
康托展开裸的康托展开&逆康托展开康托展开就是一种特殊的hash,且是可逆的-- 康托展开计算的是有多少种排列的字典序比这个小,所以编号应该+1:逆运算同理(-1). 序列->序号:( ...
3403: [Usaco2009 Open]Cow Line 直线上的牛
3403: [Usaco2009 Open]Cow Line 直线上的牛 Time Limit: 3 Sec Memory Limit: 128 MB Submit: 71 Solved: 62 ...
POJ3617 Best Cow Line【水题】
Best Cow Line Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 27635 Accepted: 7438 De ...

Best Cow Line

Best Cow Line相关推荐

最新文章

热门文章