Pick-up sticks
题目：http://poj.org/problem?id=2653
Description
Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no stick on top of them. Stan has noticed that the last thrown stick is always on top but he wants to know all the sticks that are on top. Stan sticks are very, very thin such that their thickness can be neglected.
Input
Input consists of a number of cases. The data for each case sta
最低0.47元/天 解锁文章
122
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
