POJ 2823 Sliding Window

Sliding Window

链接：http://poj.org/problem?id=2823

Time Limit: 12000MS		Memory Limit: 65536K

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.

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

Source

POJ Monthly--2006.04.28, Ikki

题意：给定一个数列，从左至右输出每个长度为m的数列段内的最小数和最大数。
数列长度：N<=106，m<=N

#include<iostream>
#include<cstdio>
using namespace std;const int N = 1000005;int n,k,m,mn[N],mx[N],n1,n2;struct node{int id, data;
};node dj[N],dz[N];//dz 递增队列 dj 递减队列 int main()
{cin >> n >> k;int headj = 1,tail1 = 0,headz = 1,tail2 = 0;for(int i = 1; i <= n; i++){scanf("%d",&m);while(m <= dj[tail1].data && tail1 >= headj) tail1 --;//保持单调性 while(m >= dz[tail2].data && tail2 >= headz) tail2 --;dj[++tail1].data = m;dj[tail1].id = i;dz[++tail2].data = m;dz[tail2].id = i;if(i >= k){//开始记录第n段中的最值 if(dj[headj].id <= i-k) mn[++n1] = dj[++headj].data;//过期了 else mn[++n1] = dj[headj].data;if(dz[headz].id <= i-k) mx[++n2] = dz[++headz].data;else mx[++n2] = dz[headz].data;}}for(int i = 1; i <= n1; i++)printf("%d ",mn[i]);cout<<endl;for(int i = 1; i <= n1; i++)printf("%d ",mx[i]);return 0;
}

第一次手打队列，以后还是用双向吧

转载于:https://www.cnblogs.com/EdSheeran/p/8406551.html

POJ 2823 Sliding Window相关推荐

POJ 2823 Sliding Window（单调队列）
http://poj.org/problem?id=2823 题意: 给出数组和滑动窗口的大小,每次输出滑动窗口中的最大值和最小值. 思路: 这题可以算是单调队列的模板题了,分别维护单调递增和单调递减 ...
POJ 2823 Sliding Window (单调队列）
单调队列加了读入挂比不加更慢.... 而且这份代码要交c++ 有大神G++跑了700ms..... orzorzorz #include<iostream> #include<cs ...
【POJ】2823 Sliding Window
单调队列. 1 /* 2823 */ 2 #include <iostream> 3 #include <sstream> 4 #include <string> ...
【POJ - 2823】 Sliding Window（单调队列用双端队列实现或模拟队列）
题干: An array of size n ≤ 10 6 is given to you. There is a sliding window of size k which is moving f ...
POJ2823 Sliding Window【单调队列】【线段树】【ST表】
Sliding Window POJ - 2823 题意: 给出一个长度为N的序列,通过一个窗口,可以看到序列中连续的K个元素,窗口从最左边出发,每次移动一个单位,对于每次移动,输出当前窗口中的最大值 ...
Sliding Window滑动窗口（单调队列）
Sliding Window滑动窗口 POJ - 2823 目录 Sliding Window滑动窗口 POJ - 2823 题意描述解题思路 AC代码 An array of size n ≤ 1 ...
LeetCode 滑动窗口（Sliding Window）类问题总结
导语滑动窗口类问题是面试当中的高频题,问题本身其实并不复杂,但是实现起来细节思考非常的多,想着想着可能因为变量变化,指针移动等等问题,导致程序反复删来改去,有思路,但是程序写不出是这类问题最大的障碍 ...
python实现滑动窗口平均_数据流滑动窗口平均值 · sliding window average from data stream...
［抄题］: 给出一串整数流和窗口大小,计算滑动窗口中所有整数的平均值. MovingAverage m = new MovingAverage(3); m.next(1) = 1 // 返回 1.00 ...
LeetCode 239. Sliding Window Maximum
原题链接在这里:https://leetcode.com/problems/sliding-window-maximum/ 题目: Given an array nums, there is a sl ...

POJ 2823 Sliding Window

POJ 2823 Sliding Window相关推荐

最新文章

热门文章