HDU 1896：Stones（优先队列）

青龙指引你

于 2017-07-24 21:00:58 发布

阅读量487

点赞数 1

分类专栏： STL

本文链接：https://blog.youkuaiyun.com/xp731574722/article/details/76038046

版权

Stones

Time limit:3000 ms Memory limit:32768 kB OS:Windows

Problem Description

Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in th