POJ 3617 Best Cow Line 贪心
来源:互联网 发布:华为怎么下载软件 编辑:程序博客网 时间:2024/09/21 06:37
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
Source
[Submit] [Go Back] [Status] [Discuss]
#pragma warning(disable:4786)//使命名长度不受限制#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈#include <map>#include <set>#include <queue>#include <cmath>#include <stack>#include <cctype>#include <cstdio>#include <cstring>#include <stdlib.h>#include <iostream>#include <algorithm>#define rd(x) scanf("%d",&x)#define rd2(x,y) scanf("%d%d",&x,&y)#define rds(x) scanf("%s",x)#define rdc(x) scanf("%c",&x)#define ll long long int#define maxn 100005#define mod 1000000007#define INF 0x3f3f3f3f //int 最大值#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)#define MT(x,i) memset(x,i,sizeof(x))#define PI acos(-1.0)#define E exp(1)using namespace std;char str[maxn];int main(){ int n,a,b; while(rd(n)!=EOF){ FOR(i,1,n)cin>>str[i]; bool flag; b=n,a=1; int cnt=0; while(a<=b){ for(int i=0;a+i<b;++i) if(str[a+i]<str[b-i]){ flag=true;break; }else if(str[a+i]>str[b-i]){ flag=false;break; } if(flag)putchar(str[a++]); else putchar(str[b--]); cnt++; if(cnt%80==0)putchar('\n'); } printf("\n"); } return 0;}/*6ACDBCB*/
- 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 3617Best 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 3617 Best Cow Line - 贪心
- tornado.gen.coroutine-编写异步函数
- Virtualbox WDDM之DxgkDdiSetVidPnSourceVisibility
- android volley 总结(一)
- phpstudy 配置虚拟域名
- Shell中uniq与sort -u两种去重的对比
- POJ 3617 Best Cow Line 贪心
- tornado.concurrent-Future
- 23种设计模式学习
- git忽略已经被提交的文件
- 数据结构-平衡树
- android引入类库出现错误原因
- 百度地图android studio导入开发插件
- Android开发中error: Error retrieving parent for item: No resource found that matches the given name解决方法
- linux I2C读写应用程序