【思维】Stacks of Flapjacks

#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

#define LL long long

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;!isdigit(c);c=getchar()) if(c==‘-‘) f=-1;
	for(;isdigit(c);c=getchar()) x=x*10+c-‘0‘;
	return x*f;
}
const int INF=9999999;
const int MAXN=100000;

int a[MAXN+1]; 
int cnt; int N,M; 
char str[MAXN+1];
int b[MAXN+1];

bool cmp(int a,int b){
	return a>b;
}
int ret;
void ref(int k){
	for(int i=1;i<=k/2;i++)
		swap(a[i],a[k-i+1]);
	return ;
}
int ans[MAXN+1];

int main(){
	while(scanf("%d",&a[1])!=EOF){
		ret=0;
		gets(str); cnt=1;
		int len=strlen(str);
		for(int i=0;i<len;i++){
			if(str[i]==‘ ‘) continue;
			else {
				int p=i+1;
				int sum=str[i]-‘0‘;
				while(isdigit(str[p])){
					sum=sum*10+str[p]-‘0‘;
					++p;
				}
				i=p;
				a[++cnt]=sum;
			}
		}
		N=cnt;
		for(int i=1;i<=N;i++) b[i]=a[i];
		for(int i=1;i<N;i++) printf("%d ",b[i]);
		printf("%d\n",b[N]);
		sort(b+1,b+N+1,cmp);
		for(int i=1;i<=N;i++){
			int tmp;
			for(int j=1;j<=N;j++){
				if(a[j]==b[i]) {
					tmp=j; break;
				}
			}
			if(tmp==b[i]) continue;
			if(tmp!=1){
				ans[++ret]=N-tmp+1;
				ref(tmp);
			}
			if(b[i]!=1){
				ans[++ret]=i; 
				ref(N-i+1);
			}
		}
		for(int i=1;i<=ret;i++) printf("%d ",ans[i]);
		puts("0");
	}
	return 0;
}