洛谷 P2698 [USACO12MAR]花盆Flowerpot

最新推荐文章于 2021-07-26 15:20:32 发布

我要吃熊猫

最新推荐文章于 2021-07-26 15:20:32 发布

阅读量980

点赞数

分类专栏：单调队列

本文链接：https://blog.csdn.net/chai_jing/article/details/52566274

版权

本文介绍了如何使用单调队列解决USACO竞赛中的一个题目，即如何计算在保证水滴落在花盆内的时间差至少为D的情况下，最小的花盆宽度。通过对水滴坐标进行处理，并通过枚举左端点与维护最大最小值的单调队列，求得满足条件的最小宽度。当无法构造满足要求的花盆时，输出-1。

摘要由CSDN通过智能技术生成

题目描述

Farmer John has been having trouble making his plants grow, and needs your help to water them properly. You are given the locations of N raindrops (1 <= N <= 100,000) in the 2D plane, where y represents vertical height of the drop, and x represents its location over a 1D number line:

;

Each drop falls downward (towards the x axis) at a rate of 1 unit per second. You would like to place Farmer John’s flowerpot of width W somewhere along the x axis so that the difference in time between the first raindrop to hit the flowerpot and the last raindrop to hit the flowerpot is at least some amount D (so that the flowers in the pot receive plenty of water). A drop of water that lands just on the edge of the flowerpot counts as hitting the flowerpot.

Given the value of D and the locations of the N raindrops, please compute the minimum possible value of W.