Stacks of Flapjacks
来源:互联网 发布:怎么扣篮 知乎 编辑:程序博客网 时间:2024/06/06 15:48
Stacks of Flapjacks
Background
Stacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, operating systems, and discrete event simulation. Stacks are also important in the theory of formal languages.
This problem involves both butter and sustenance in the form of pancakes rather than bread in addition to a finicky server who flips pancakes according to a unique, but complete set of rules.
The Problem
Given a stack of pancakes, you are to write a program that indicates how the stack can be sorted so that the largest pancake is on the bottom and the smallest pancake is on the top. The size of a pancake is given by the pancake's diameter. All pancakes in a stack have different diameters.
Sorting a stack is done by a sequence of pancake ``flips''. A flip consists of inserting a spatula between two pancakes in a stack and flipping (reversing) the pancakes on the spatula (reversing the sub-stack). A flip is specified by giving the position of the pancake on the bottom of the sub-stack to be flipped (relative to the whole stack). The pancake on the bottom of the whole stack has position 1 and the pancake on the top of a stack ofn pancakes has position n.
A stack is specified by giving the diameter of each pancake in the stack in the order in which the pancakes appear.
For example, consider the three stacks of pancakes below (in which pancake 8 is the top-most pancake of the left stack):
8 7 2 4 6 5 6 4 8 7 8 4 5 5 6 2 2 7
The stack on the left can be transformed to the stack in the middle viaflip(3). The middle stack can be transformed into the right stack via the commandflip(1). The Input
The input consists of a sequence of stacks of pancakes. Each stack will consist of between 1 and 30 pancakes and each pancake will have an integer diameter between 1 and 100. The input is terminated by end-of-file. Each stack is given as a single line of input with the top pancake on a stack appearing first on a line, the bottom pancake appearing last, and all pancakes separated by a space.
The Output
For each stack of pancakes, the output should echo the original stack on one line, followed by some sequence of flips that results in the stack of pancakes being sorted so that the largest diameter pancake is on the bottom and the smallest on top. For each stack the sequence of flips should be terminated by a 0 (indicating no more flips necessary). Once a stack is sorted, no more flips should be made.
Sample Input
1 2 3 4 55 4 3 2 15 1 2 3 4
Sample Output
1 2 3 4 505 4 3 2 11 05 1 2 3 41 2 0
#include<cstdio>#include<iostream>#include<sstream>#include<algorithm>using namespace std;const int maxn = 30 + 5;int n, a[maxn];void flip(int p){ for(int i = 0; i < p-i; i++) swap(a[i], a[p-i]); printf("%d ", n-p);}int main(){ string s; while(getline(cin, s)) { cout << s << "\n"; stringstream ss(s); n = 0; while(ss >> a[n]) n++; cout<<n<<endl; for(int i = n-1; i > 0; i--){ //找到当前最大值所在的位置; int p = max_element(a, a+i+1) - a; cout<<p<<endl; //如果最大值与它所在的位置相同,继续下一个; if(p == i) continue; //转换;将最大值放到第一个位置; if(p > 0) flip(p); flip(i); } printf("0\n"); } return 0;}
- Stacks of Flapjacks
- 120 - Stacks of Flapjacks
- 120 - Stacks of Flapjacks
- 120 - Stacks of Flapjacks
- uva120 stacks of flapjacks
- uva120 Stacks of Flapjacks
- uva120 Stacks of Flapjacks
- 120 - Stacks of Flapjacks
- 110402 Stacks of Flapjacks
- 120 - Stacks of Flapjacks
- UVA120 Stacks of Flapjacks
- UVA Stacks of Flapjacks
- Stacks of Flapjacks uva
- UVa_120 - Stacks of Flapjacks
- uva Stacks of Flapjacks
- 120 - Stacks of Flapjacks
- Stacks of Flapjacks
- Stacks of Flapjacks
- 天使迪玛利亚
- 机器视觉中常用的数据测试集 计算机视觉数据集
- 关于QT移植及触摸屏的问题
- C语言返回文件大小的功能(fseek和ftell的使用)
- Ubuntu的Kdump
- Stacks of Flapjacks
- mybatis传入集合类型参数 动态sql构建
- 死亡本身就是一个很哲学的问题
- 视图实现圆角效果的三种方法及比较
- Spring JdbcTemplate方法详解
- uva 10369(最小生成树)
- 谴毁饭苛饭轿干厮泊杉仿涛唤饭泊
- poj解题报告——2109
- 优下炊号门杭钠残涛灾车啃娇惶侄