【例题 8-1 UVA 120 】Stacks of Flapjacks

【链接】 我是链接,点我呀:)
【题意】

在这里输入题意

【题解】

从大到小安排。
显然想让第i大的数字归位
只要让他翻到最上面,然后再翻回来就ok了
即operate(pos[i]) -> operate(i)

【代码】

/*
    1.Shoud it use long long ?
    2.Have you ever test several sample(at least therr) yourself?
    3.Can you promise that the solution is right? At least,the main ideal
    4.use the puts("") or putchar() or printf and such things?
    5.init the used array or any value?
    6.use error MAX_VALUE?
    7.use scanf instead of cin/cout?
    8.whatch out the detail input require
*/
/*
    一定在这里写完思路再敲代码!!!
*/
#include <bits/stdc++.h>
using namespace std;

const int N = 30;

string s;
int a[N+10],b[N+10],n;

void out(int x){
    cout << n-x+1 <<' ';
    reverse(a+1,a+1+x);
}

int main(){
    #ifdef LOCAL_DEFINE
        freopen("rush_in.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(0),cin.tie(0);
    while (getline(cin,s)){
        n = 0;
        stringstream ss(s);
        int x;
        while (ss>>x){
            a[++n] = x;
            b[n] = x;
        }

        for (int i = 1;i <= n;i++){
            cout <<a[i];
            if (i==n) cout << endl;else cout <<' ';
        }
        sort(b+1,b+1+n);
        reverse(b+1,b+1+n);

        for (int i = 1;i <= n;i++){
            int suppose = n-i+1;
            for (int j = 1;j <= n;j++)
                if (a[j]==b[i]){
                    if (j==suppose) break;
                    if (j==1) {
                        out(suppose);
                        break;
                    }
                    out(j);out(suppose);
                    break;
                }
        }
        cout <<0<<endl;
    }
    return 0;
}