POJ-3617 Best Cow Line
来源:互联网 发布:用平板怎么看淘宝直播 编辑:程序博客网 时间:2024/04/30 00:03
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>
using namespace std;
const int MAX=2000;
int N;
char S[MAX+1];
int main()
{
cin>>N;
for(int i=0;i<N;i++)
{
cin>>S[i];
}
int a=0,b=N-1,L=0;
while(a<=b)
{
bool left=false;
for(int i=0;a+i<=b;i++)
{
if(S[a+i]<S[b-i])
{
left=true;
break;
}
else if(S[a+i]>S[b-i])
{
left=false;
break;
}
}
if(left)
putchar(S[a++]);
else putchar(S[b--]);
L++;
if(L%80==0)
putchar('\n');
}
return 0;
}
- POJ-3617-Best Cow Line
- POJ 3617 Best Cow Line
- POJ:3617 Best Cow Line
- POJ 3617 Best Cow Line
- POJ-3617 Best Cow Line
- poj 3617 Best Cow Line
- poj 3617 Best Cow Line
- POJ 3617 Best Cow Line
- POJ 3617 Best Cow Line
- POJ 3617 Best Cow line
- POJ Best Cow Line 3617
- POJ 3617 Best Cow Line
- Best Cow Line(POJ-3617)
- POJ 3617 Best Cow Line
- POJ 3617 Best Cow Line
- POJ-3617 Best Cow Line
- poj 3617 Best Cow Line
- POJ 3617 Best Cow Line
- Android 实现线程的方法
- Eoe客户端源码分析---ViewPager、 PageAdapter和PageIndicator 的使用
- 完美解读Linux中文件系统的目录结构
- 嵌入式OS入门笔记-以RTX为案例:二.快速移植到RTX
- poj 1664 小苹果(递推)
- POJ-3617 Best Cow Line
- ARM的六大类指令集--- 加载/存储指令
- eclipse maven插件的最新地址
- ffmpeg无法定位序数3751于动态链接库avcodec-55.dll上
- MySQL 5.6.19 二进制的安装方式
- linux 命令行参数处理篇
- linux 驱动开发调试问题
- Head First 原版高清下载(资源地址收藏)
- VMD视频移动侦测技术