Best Cow Line
来源:互联网 发布:拜占庭知乎 编辑:程序博客网 时间:2024/06/05 10:03
Best Cow Line
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 12656 Accepted: 3666
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>using namespace std;int main(){ int n,i,j,k,t,tt,cnt; char str[2100]; cin >> n; for (i=0;i<n;++i) { cin >> str[i]; } k=0; cnt=0; j=n-1; while (k<j) { cnt++; if (str[k]<str[j]) { cout << str[k++]; } else if (str[k]>str[j]) { cout << str[j--]; } else { t=k; tt=j; while (t<tt) { if(str[t]==str[tt]) t++,tt--; else break; } if(t>tt) { if(str[k]>str[j]) cout << str[j--]; else cout << str[k++]; } else { if(str[t]>str[tt]) cout << str[j--]; else cout << str[k++]; } } if(cnt%80==0)cout << endl; if(k==j)cout << str[k]; } cout << endl; return 0;}
- pku3617 Best Cow Line
- poj Best Cow Line
- Best Cow Line
- POJ3617 Best Cow Line
- Best Cow Line
- POJ3617 Best Cow Line
- POJ3617 Best Cow Line
- Best Cow Line
- best cow line(poj3617)
- Best Cow Line
- POJ-Best Cow Line
- POJ3617-Best Cow Line
- B - Best Cow Line
- POJ3617 Best Cow Line
- Tyvj2500 Best Cow Line
- POJ3617 Best Cow Line
- Best Cow Line FZU
- poj3617 Best Cow Line
- universalimageloader增加防盗链功能,设置header请求头
- break,continue,goto,return区别详解
- Design里 无法拖动控件到UI界面
- 杭电ACM 2091:空心三角形
- Linux shell的算术运算及算术扩展
- Best Cow Line
- 第三章第43题
- PostThreadMessage的用法
- Tomcat 7在Ubuntu14.04下默认安装路径
- LINUX查看硬件信息[转]
- BC#41 hdu 5228 5229
- Android 中 java.lang.IllegalArgumentException: pointerIndex out of range 异常的处理方法
- java基础——String类
- NOJ 2015年陕西省程序设计竞赛网络预赛(正式赛)(约翰·亨利-dp)