Best Cow Line(求最小字典数)
来源:互联网 发布:云豹直播完整源码 编辑:程序博客网 时间:2024/05/21 10:19
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 theith 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<stdio.h>#include<iostream>using namespace std;#define maxn 1000int n;char ch[maxn],output[maxn];int main(){ while(scanf("%d",&n)) { getchar(); for(int i=0;i<n;i++) scanf("%c%*c",&ch[i]); int dex=0; int s=0,e=n-1; while(s<=e) { bool left=true; for(int i=0;s+i<=e;i++) { if(ch[s+i]<ch[e-i])//输出小的 { left=true; break; } if(ch[s+i]>ch[e-i]) { left=false; break; } } //相等的话比较下一层 if(left) output[dex++]=ch[s++]; else output[dex++]=ch[e--]; } for(int i=0;i<dex;i++) { putchar(output[i]); if((i+1)%80==0) printf("\n"); } printf("\n"); }}
- Best Cow Line(求最小字典数)
- 字典序最小问题Best Cow Line
- 字典序最小问题——Best Cow Line
- POJ 3617 Best Cow Line (字典序最小_贪心)
- POJ 3617 Best Cow Line(字典序最小问题)
- 043_字典序最小问题(best cow line)
- POJ 3617 Best Cow Line [贪心] [字典序最小]
- POJ No.3617-Best Cow Line(字典序最小问题)
- POJ3617 Best Cow Line (字典序最小问题)
- POJ 3617 Best Cow Line(贪心+最小字典序)
- 字典序最小问题-贪心-Best Cow Line-POJ3617
- POJ3617 Best Cow Line(贪心,字典序最小)
- poj 3617 Best Cow Line(取字典序最小的一种排序)
- 【OJ】贪心法(最小字典序)poj3617 Best Cow Line// acmclub 12701/12695
- POJ NO.3617 Best Cow Line(字典序最小问题)
- 2.2.3 字典序最小问题 -Best Cow Line(POJ 3617)
- POJ 3617Best Cow Line(字典序最小的字符串)
- POJ 3617 Best Cow Line(字典序)
- GoKit-SoC-ESP8266 开发套件,让我大吃一斤。
- java乱码问题解决方法
- 人人网JS表单判断
- OSI七层网络模型
- Java中不常见的关键字:strictfp,transient
- Best Cow Line(求最小字典数)
- 《React-Native系列》25、 详解Redux的connect方法
- mysql在linux上本地启动
- Debian 用 GLIBC 替代 EGLIBC
- 二叉排序树
- jstl获取url中的值
- 导入一个JavaWeb项目到Eclipse
- tcp多进程并发服务器
- C/C++中extern关键字详解