POJ3617 Best Cow Line 贪心

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.
样例

6
A
C
D
B
C
B

 

 

ABCBCD

 

这个题有点坑，数据是一个一个输入的，并且是多组输入，而且一行最多输出80个字符。

为了保证最小字典序，每次比较第一个字符和最后一个字符，利用string的特性，把小的添加到结尾。如果两个相等，就往里面找，最终左边大右侧减一，右边大左侧减一。我的做法可能比较笨，我直接分开找，计算量应该是从1加到1000，结果应该是500500。不超时真好啊。开心。

 

#include<cstdio>
#include<string>
#include<algorithm>
#include<iostream>
using namespace std;

int main()
{
    int n;
    while(~scanf("%d",&n))
{
    string s;
    getchar();
    int m = n;
    while(n--)
    {
        char h;
        scanf("%c",&h);
        getchar();
        s+=h;
      //  cout<<s<<endl;
    }
    string ss;
    int i = 0,  j = m-1;
    while(i<=j)
    {
        if(i == j) {ss+=s[i];break; }
        if(s[i] < s[j]) {ss+=s[i];i++;}
        else if(s[i] > s[j]) {ss+=s[j];j--;}
        else if(s[i] == s[j]){
            int l = i, r = j;
            int ll = 1, rr = 1;
            int flag = 0;
            while((l+ll) < (r-rr))
            {
                if(s[l+ll] == s[r-rr]) {ll++;rr++;}
                else {

                    if(s[l+ll] > s[r-rr])    flag = 1;
                    else  flag = 2;
                    break;
                }
            }
            if(flag == 1) {ss+=s[j];j--;}
            else if(flag == 2) {ss+=s[i];i++;}
            else if(flag == 0) {ss+=s[i];i++;}
        }

    }

    for(int h = 0; h <m; h++)
    {
        cout<<ss[h];
        if((h+1)%80 == 0) cout<<endl;
    }
    cout<<endl;
 //   cout<<ss<<endl;
}
}