例题8-1 煎饼（Stacks of Flapjacks, UVa120）

#include <set>
#include <map>
#include <ctime>
#include <cmath>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define SF(a) scanf("%d", &a)
#define PF(a) printf("%d\n", a)  
#define SFF(a, b) scanf("%d%d", &a, &b)  
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 105
#define maxm 205
#define mod 1000000007
#define INF 10000007
#define eps 1e-4
using namespace std;
//-------------------------CHC------------------------------//
int main() {
	//IN(); OUT();
	string in;
	while (getline(cin, in)) {
		stringstream ss(in);
		vector<int> v, t, ans;
		int x;
		while (ss >> x) v.push_back(x), t.push_back(x);
		FOR(i, 0, v.size() - 1) printf("%d ", v[i]);
		printf("%d\n", v.back());
		sort(t.begin(), t.end());
		for (int i = v.size() - 1; i >= 0; --i) {
			if (t[i] != v[i]) {
				int u = find(v.begin(), v.end(), t[i]) - v.begin();
				if (u != 0) {
					ans.push_back(v.size() - u);
					reverse(v.begin(), v.begin() + u + 1);
				}
				ans.push_back(v.size() - i);
				reverse(v.begin(), v.begin() + i + 1);
			}
			//FOR(i, 0, v.size()) printf("%d", v[i]); puts("");
		}
		FOR(i, 0, ans.size()) printf("%d ", ans[i]);
		puts("0");
	}
	return 0;
}

写得还是不够简练。

int main() {
	string s;
	while (getline(cin, s)) {
		cout << s << endl;
		stringstream ss(s);
		int a[maxn], n = 0;
		while (ss >> a[n]) n++;
		for (int i = n - 1; i > 0; --i) {
			int p = max_element(a, a + i + 1) - a;
			if (p == i) continue;
			if (p) reverse(a, a + p + 1), printf("%d ", n - p);
			reverse(a, a + i + 1), printf("%d ", n - i);
		}
		puts("0");
	}
}