Sliding Window（poj-2823)

最新推荐文章于 2019-04-05 15:39:02 发布

xiaoxiede_wo

最新推荐文章于 2019-04-05 15:39:02 发布

阅读量361

点赞数

分类专栏：线段树

本文链接：https://blog.csdn.net/xiaoxiede_wo/article/details/80348120

版权

题目要求在宽度为k的滑动窗口中，找出每个位置上窗口内的最大和最小值。使用线段树可以高效地解决这个问题。原代码由于查询条件不准确导致超时，通过优化查询范围条件`if(L<=l&&r<=R) return sum[rt];`可以避免不必要的计算，提高效率。

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

Sliding Window

Time Limit: 12000MS		Memory Limit: 65536K
Total Submissions: 67410		Accepted: 19122
Case Time Limit: 5000MS

Description

An array of size n ≤ 10 ⁶ is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:
The array is [1 3 -1 -3 5 3 6 7], and k is 3.