poj 2823 Sliding Window

2020-12-02 04:46

阅读：742

标签：des style blog http color os

Sliding Window

Time Limit: 12000MS		Memory Limit: 65536K
Total Submissions: 36147		Accepted: 10700
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

线段树、区间求最值

#include"stdio.h"
#include"string.h"
#define N 1000005
int num[N];
int aa[N],bb[N];          //记录最大最小值
struct node
{
	int l,r,num,min,max;
}f[N*3];
int Min(int a,int b)          
{
	return ab?a:b;
}
void creat(int t,int l,int r)
{
	f[t].l=l;
	f[t].r=r;
	if(l==r)
	{
		f[t].num=f[t].max=f[t].min=num[r];
		return ;
	}
	int temp=t*2,mid=(l+r)/2;   
	creat(temp,l,mid);
	creat(temp+1,mid+1,r);
	f[t].max=Max(f[temp].max,f[temp+1].max);
	f[t].min=Min(f[temp].min,f[temp+1].min);
	return ;
}
int fmax(int t,int l,int r)
{
	if(f[t].l>=l&&f[t].r=r)
		return fmax(temp,l,r);
	else if(mid=l&&f[t].r=r)
		return fmin(temp,l,r);
	else if(mid



poj 2823 Sliding Window,搜素材,soscw.com
poj 2823 Sliding Window
标签：des   style   blog   http   color   os   
原文地址：http://blog.csdn.net/u011721440/article/details/24627827

上一篇：win7+ubuntu双系统安装

下一篇：Windows Tomcat 安装

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：poj 2823 Sliding Window
文章链接：http://soscw.com/index.php/essay/23193.html

亲，登录后才可以留言！

poj 2823 Sliding Window

评论

热门文章

推荐文章

最新文章

置顶文章