3617POJ

又到了换小脑筋的时刻，这道题呢，我们想取出最小字典序的字符串，我们弄出一个反转字符串，相当于，每次都取最小的，如果相同随便取就好。

#include<iostream>
#include<cstdio>
#include<string.h>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>

#define LOCAL
#define ll long long
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007

using namespace std;
/*

题意：

想法：

*/
int n;
char c;
string str,s;
void solve(string str)
{
    int a = 0,b = n - 1;
    int i;
    bool left;
    int ans = 0;
    while(a<=b)
    {
        for(i = 0; i + a<=b; i++)
        {
            left = false;
            if(str[a + i]<str[b - i])
            {
                left = true;
                break;
            }
            else if(str[a + i]>str[b - i])
            {
                left = false;
                break;
            }
        }
        if(left)
            putchar(str[a++]);
        else
            putchar(str[b--]);
        ans++;
        if(ans%80==0)
            puts("");
    }
    puts("");
}

int main()
{
#ifdef ONLINE_JUDGE
#else
    freopen("data.txt","r", stdin);
#endif
    while(~scanf("%d",&n))
    {
        str = "";
        for(int i = 0; i<n; i++)
        {
            getchar();
            scanf("%c",&c);
            str+=c;
        }
        solve(str);
    }
    return 0;
}