zoukankan      html  css  js  c++  java
  • Best Cow Line

    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.

    题目大意:

    给一个字符串,仅仅通过把字符串首部或者尾部元素移到另一个新的空字符串的尾部的方式,尽可能的构造出一个字典序最小的新的字符串

    import java.util.Scanner;
    
    public class Main {
        public static void main(String[] args) {
            Scanner scanner = new Scanner(System.in);
            int n = scanner.nextInt();
            String s = "";
            for(int i=0;i<=n;i++){
                s = s + scanner.nextLine();
            }
            int a = 0;
            int b = n-1;
            String t = "";
            while(a<=b){
                boolean left = false;
                for(int i=0;a + i <=b;i++){
                    char x = s.charAt(a+i);
                    char y = s.charAt(b-i);
                    if(x>y){
                        left = false;
                        break;
                    }
                    else if(x<y){
                        left = true;
                        break;
                    }
                }
                if(left){
                    t += s.charAt(a);
                    a++;
                }
                else {
                    t += s.charAt(b);
                    b--;
                }
    
            }
            for(int i = 0;i<t.length();i++){
                if(i%80==0&&i>0){
                    System.out.println();
                }
                System.out.print(t.charAt(i));
            }
            System.out.println();
        }
    }
  • 相关阅读:
    关于加密程序
    C++11的新特性lambda的小试牛刀RAII
    自动生成makefile的脚本
    关于pcre正则表达式库libpcre
    利用PHP执行SQL文件,将SQL文件导入到数据库
    Linux 系统是否适合于您?
    一个少年电脑病毒作者的独白
    PHP编程效率的20个要点
    JVM源码分析之javaagent原理完全解读
    如何更好的利用Node.js的性能极限
  • 原文地址:https://www.cnblogs.com/zhanghaijie/p/8433423.html
Copyright © 2011-2022 走看看