该博客介绍了USACO竞赛中的一道题，即如何放置花盆以确保水滴在至少D秒的时间内落入，并求解最小的花盆宽度。博主提出使用单调队列的方法，通过枚举左端点并扫描右端点，维护区间内水滴高度的最大值和最小值，以满足时间差要求。
题目描述
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
最低0.47元/天 解锁文章
扫一扫
230
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
