POJ 3617 Best Cow Line

Best Cow Line

Time Limit: 1000ms

Memory Limit: 65536KB

This problem will be judged on PKU. Original ID: 3617
64-bit integer IO format: %lld      Java class name: Main

Prev 

Submit Status Statistics

 Next

Type: 

None

 None 图论     2-SAT     割点/桥/双连通分量     环/拓扑排序/强连通分量     最短路         Bellman Ford         Dijkstra/Floyd Warshall     欧拉回路/路径     差分约束     最小生成树     稳定婚姻问题     树     最小树形图     网络流/匹配         一般图匹配             二分匹配             Hopcroft–Karp算法             Weighted Bipartite Matching/匈牙利算法         网络流             最大流/最小割             最小费用最大流 搜索     基础递归     BFS/DFS     回溯剪枝/分支限界     IDA* Search     Parsing/Grammar     Advanced Search Techniques         二分查找/二分         三分查找 几何     基础几何     计算几何     凸包     Pick定理     旋转卡壳     半平面交 博弈     Green Hackenbush/Colon Principle/Fusion Principle     Nim     SG函数 矩阵     高斯消元     矩阵快速幂 数据结构     基础数据结构     树状数组     二叉搜索树     Hashing     Orthogonal Range Search     RMQ/LCA     线段树     字典树     排序     并查集 字符串     KMP     AC自动机     后缀数组/后缀树     Manacher 数学     基础数学     大整数运算     数论         中国剩余定理         扩展欧几里德算法         容斥原理         模运算     排列组合         Group Theory/Burnside's lemma         Counting     概率/期望     欧拉函数     乘法逆元     莫比乌斯反演     快速傅里叶变换     调和级数     快速幂 动态规划     基础DP     背包问题     区间DP     概率DP     状压DP     数位DP     树形DP     插头DP     斜率优化 Others     Tricky     Hardest     Unusual     Brute Force     Implementation     Constructive Algorithms     Two Pointer     Bitmask     Beginner     Discrete Logarithm/Shank's Baby-step Giant-step Algorithm     贪心     分治法                  Tag it!

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

眼残 忽视了这个

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.

 就一直wa ，英语求救中；

题目大意：给定一个字符串，重排，每次从头或尾取较小值放到新序列的末尾。
需要注意的地方：不能简单的每次首尾比较取最小值，因为如果相等还需要继续看下一个要比较的对儿那个更小。
题目要求是每80个为一行输出

ac代码

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<cctype>
using namespacestd;
char str0[2002];
char str1[2002];
intmain()
{

int n;
while (cin>>n)
{
for (int i =0; i < n; i++)cin >> str0[i];int a =0;
int b = n - 1;

int k = 0;
while (a<=b)
{
bool  flag = false;
for (int i =0; a + i <= b; i++)
{
if (str0[a + i] < str0[b - i])
{
flag = true;
break;
}
else if (str0[a + i] > str0[b - i])
{
flag = false;
break;
}
}
if (flag) putchar(str0[a++]);
else putchar(str0[b--]);
k++;
if (k == 80)

{
puts("");
k = 0;
}
}

puts("");
}
return 0;
}