超级会员免费看
迈克尔在长街购物时通常随机停车，然后步行到各个商店。问题在于帮助迈克尔选择一个最佳的停车位置，以使他购物时行走的距离最短。长街是一条直线，所有位置都是整数。每个停车位都有一个整数位置。迈克尔不想为多个停车位付费，他愿意扛着所有购物袋行走。
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 positions are integer. You pay for parking in a specific slot, which is an in
订阅专栏 解锁全文
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
