【算法练习】递归 百练poj2275:Flipping Pancake 翻煎饼

题目链接：http://bailian.openjudge.cn/practice/2275

注意要用STL模板的话，reverse 

#include<algorithm>

 

2275:Flipping Pancake

总时间限制: 

1000ms

内存限制: 

65536kB

描述

We start with a stack n of pancakes of distinct sizes. The problem is to convert the stack to one in which the pancakes are in size order with the smallest on the top and the largest on the bottom. To do this, we are allowed to flip the top k pancakes over as a unit (so the k-th pancake is now on top and the pancake previously on top is now in the k-th position). 

For example: 

This problem is to write a program, which finds a sequence of at most (2n - 3) flips, which converts a given stack of pancakes to a sorted stack.