poj_3632 摸爬滚打在水题中

最新推荐文章于 2017-11-21 14:39:01 发布

狮子和猿

最新推荐文章于 2017-11-21 14:39:01 发布

阅读量653

点赞数

CC 4.0 BY-SA版权

分类专栏： Data Struct、Algorithm and ACM 文章标签： distance integer input random ini each

本文链接：https://blog.youkuaiyun.com/cscj2010/article/details/6398789

Data Struct、Algorithm and ACM 专栏收录该内容

281 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

迈克尔在长街购物时通常随机停车，然后步行到各个商店。问题在于帮助迈克尔选择一个最佳的停车位置，以使他购物时行走的距离最短。长街是一条直线，所有位置都是整数。每个停车位都有一个整数位置。迈克尔不想为多个停车位付费，他愿意扛着所有购物袋行走。

Optimal Parking

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6073		Accepted: 3383

Description

When shopping on Long Street, Michael usually parks his car at some random location, and then walks to the stores he needs. Can you help Michael choose a place to park which minimises the distance he needs to walk on his shopping round? Long Street is a straight line, where all position

了解本专栏