Best_Cow_Line
来源:互联网 发布:使命召唤二战 知乎 编辑:程序博客网 时间:2024/04/30 02:46
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
6ACDBCB
Sample Output
ABCBCD
#include "iostream"#include "string"using namespace std;int N;string S[2001];void solve(){int lo = 0;int hi = N - 1;int cnt = 0;while(lo <= hi){bool leftishigh = false;for(int i = 0; lo + i <= hi - i; ++i){if(S[lo + i] > S[hi - i]){leftishigh = true;break;}else if(S[lo + i] < S[hi - i]){leftishigh = false;break;}}if(leftishigh) cout << S[hi--];else cout << S[lo++];cnt++;if(cnt % 80 == 0) cout << endl;}}int main(int argc, char const *argv[]){cin >> N;for(int i = 0; i < N; ++i){cin >> S[i];}solve();return 0;}除了每行80个字符外没什么难度
- Best_Cow_Line
- iOS - iOS开发碎碎
- 【hibernate学习之路3】Hibernate核心接口,主键生成策略
- 第八周项目3-1:分数类中的运算符重载
- win7上安装CentOS7双系统(U盘启动)
- 根据两点经纬度坐标计算距离
- Best_Cow_Line
- 微营销好标题之喜闻乐见(微营销标题吸引粉丝篇-6)
- Hadoop : MapReduce中的Shuffle和Sort分析
- spring学习笔记(20)——基于配置文件方式配置AOP
- UI--从学习styleable自定义view属性到一点儿更有意思的尝试
- Security Analytics and Threat Analysis brighttalk
- 应用程序的安装
- 唯一性约束和唯一性索引的区别
- HDOJ1216 Assistance Required 打表