题目大意:一摞盘子,从上到下。个数N:1~30, 盘子直径D:1~100,求:每次只能执行从顶部到某一个的反转,也就是像堆栈一样,先倒出来,再倒回去,最终实现,从顶到底有序(升序)。输出每次反转的位置(即每次反转的底层位置),编号从底到顶从1~N。(没要求最优,能够实现就可以)
解题思路:模拟
#include <cstdio>
#include <algorithm>
using namespace std;
void change(int *arr, int n,int pos) {
printf("%d ", n - pos);
for (int i = 0; 2 * i < pos; i++) {
int temp = arr[pos - i];
arr[pos - i] = arr[i];
arr[i] = temp;
}
}
int main() {
int num, arr[35], brr[35];
char c;
while (scanf("%d%c", &arr[0], &c) != EOF) {
int n = 1;
while (c != '\n')
scanf("%d%c", &arr[n++], &c);
for (int i = 0; i < n; i++) {
brr[i] = arr[i];
printf("%d%c", arr[i], i < n - 1 ? ' ' : '\n');
}
sort(brr, brr + n);
for (int i = n - 1; i >= 0; i--) {
if (arr[i] == brr[i])
continue;
for (int j = i - 1; j >= 0; j--)
if (arr[j] == brr[i]) {
if (j != 0)
change(arr, n, j);
change(arr, n, i);
}
}
printf("0\n");
}
return 0;
}