贪心字典序最小问题poj3617
来源:互联网 发布:血源武器数据 编辑:程序博客网 时间:2024/06/06 02:11
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
2.将最后一个字符加在新串尾部
使得新串最小
ps; 每80为一个新串
字典序:是指从前到后比较两个字符串大小的方法。首先比较第一个字符大小,如果不同则第一个字符小的字符串更小,如果相同则比较第二个、、、
如此继续。。比较谁大谁小
#include<stdio.h>#include<iostream>#include<string.h>#include<algorithm>using namespace std;char str[3005];int n;void solve(){ int a = 0,b=n-1; int cnt=0; while(a<=b) { bool left = true ; for(int i=0; a+i<=b; i++) { if(str[i+a]<str[b-i]) { left = true ; break; } else if(str[i+a]>str[b-i]) { left = false; break; } } if(left) putchar(str[a++]); else putchar(str[b--]); cnt++; if(cnt==80) { cout<<endl; cnt=0; } } cout<<endl;}int main(){ while(cin>>n) { for(int i=0;i<n;i++) cin>>str[i]; str[n]='\0'; solve(); }}
- 贪心字典序最小问题poj3617
- poj3617字典序问题【贪心】
- 字典序最小问题 前后删除加入 贪心poj3617
- 字典序最小问题-贪心-Best Cow Line-POJ3617
- POJ3617(字典序最小问题)
- poj3617(字典序最小问题)
- POJ3617 字典序最小问题
- POJ3617 Best Cow Line(贪心,字典序最小)
- 贪心专练2 最小字典序排序POJ3617
- POJ3617-贪心字典序 水
- POJ3617 Best Cow Line (字典序最小问题)
- 【OJ】贪心法(最小字典序)poj3617 Best Cow Line// acmclub 12701/12695
- poj3617 生成字典序最小字符串
- POJ3617---Best Cow Line(字典序,贪心)
- 字典序最小问题--贪心入门
- 贪心算法——字典序最小问题
- 练习题 No.4 字典序最小问题(贪心法)
- ACM算法学习之贪心算法---字典序POJ3617(算法思想篇)
- 【MongoDB】在windows平台下mongodb的分片集群(三)
- 【树状数组】段修改,点查询
- nginx中父子进程工作的主体函数
- Java之美[从菜鸟到高手演变]之Synchronized和ReentrantLock锁机制的比较
- CSDN轻松周赛赛题:能否被8整除
- 贪心字典序最小问题poj3617
- JOOMLA 无限循环中检测到
- (三)线程同步工具集_1---控制线程并发访问一个资源
- js一个括号错位引发的 Uncaught ReferenceError: gritterMsg is not defined
- C语言-指针的学习
- FTP两种工作模式:主动模式(Active FTP)和被动模式(Passive FTP)
- Hduoj1166 【树状数组】
- atexit()函数 -- 注册终止函数
- poj 1436 线段树 '三元组'个数