POJ 3617 Best Cow Line
来源:互联网 发布:疯狗软件 编辑:程序博客网 时间:2024/05/17 09: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 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
Code
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); char data[] = new char[N]; for (int i = 0; i < N; i++) data[i] = sc.next().charAt(0); int a = 0, b = N - 1, count = 0; boolean flag = true; while (a <= b) { for (int i = 0; a + i <= b; i++) { char head = data[a + i]; char tail = data[b - i]; if (head < tail) { flag = true; count++; break; } else if (head > tail) { flag = false; count++; break; } } if (flag) System.out.printf("%c", data[a++]); else System.out.printf("%c", data[b--]); /* 注意换行 */ if (count % 80 == 0) System.out.println(); } System.out.println(); }}
- 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
- HelpProvider使用方法
- [原创] Demo: Python crawler use chrome headless
- Java学习笔记 --- ArrayList的动态扩容
- 第 4 章 结构型模式
- 调整数组顺序使奇数位于偶数前面
- POJ 3617 Best Cow Line
- HOJ 2085
- Git本地化基本操作
- 掌握设计原则
- CXF 创建一个简单的Webservice例子
- AspectJ注解方式实现AOP
- background-size布局和移动端图片的等比缩放
- 浅谈并查集,借助畅通工程
- 51talk-9 She is a boodle