线段树-poj-2823
来源:互联网 发布:姚明奥运会数据 编辑:程序博客网 时间:2024/05/16 03:48
Sliding Window
Description
An array of size n ≤ 106 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.
Window position
Minimum value
Maximum value
[1 3 -1] -3 5 3 6 7
-1
3
1 [3 -1 -3] 5 3 6 7
-3
3
1 3 [-1 -3 5] 3 6 7
-3
5
1 3 -1 [-3 5 3] 6 7
-3
5
1 3 -1 -3 [5 3 6] 7
3
6
1 3 -1 -3 5 [3 6 7]
3
7
Your task is to determine the maximum and minimum values in the sliding window at each position.
Input
The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line.
Output
There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.
Sample Input
8 3
1 3 -1 -3 5 3 6 7
Sample Output
-1 -3 -3 -3 3 3
3 3 5 5 6 7
大意:给出数组a,内容为 a1 a2 a3 ... an。再给一个常数k。从i=1起,计算ai、a i+1、...、a i+k-1区间内的最小值和最大值。
线段树咯。
- poj 2823 线段树
- 线段树-poj-2823
- poj 2823 线段树
- POJ 2823 线段树,RMQ
- POJ 2823线段树水
- poj 2823(线段树)
- POJ 2823 Sliding Window //线段树
- POJ 2823 阉割版线段树
- POJ 2823 线段树 暴力之...
- POJ 2823 Sliding Window 线段树
- poj 2823 Sliding Window (线段树,RMQ)
- POJ 2823 Sliding Window 线段树求解
- POJ 2823 线段树区间查询
- POJ 2823 线段树简单操作
- POJ 2823 线段树 Or 单调队列
- poj 2823 Sliding Window(线段树)
- POJ 2823 Sliding Window 线段树
- poj 2823 Sliding Window 线段树基础
- 递归实现int转化为char字符串
- java线程池管理
- leetcode第一刷_Spiral Matrix II
- 顺序表的增删改查
- 中国天气网 天气预报API 国家气象局 根据城市名称抓取城市ID,XML格式、JSON格式、图片代码
- 线段树-poj-2823
- Android小应用----背景图片设置器
- 分享一个计算机控制的实验例程
- cygwin的入门
- 常用的正则表达式大全
- bat脚本命令
- PHP Apache shutdown unexpectedly启动错误解释及解决办法
- ny吝啬的国王
- 深入探索spring技术内幕(六): JDK动态代理和cglib生成代理