code_snippet/poj_2823.cpp at master · william31212/code_snippet · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <iostream>
#include <cstdio>

using namespace std;

int N,K;
int arr[1000001];
int indexx[1000001];
int qu[1000001];
int ans[1000001];

void getmin()
{
	int tail = 0,head = 1;
	for (int i = 1; i < K; ++i)
	{
		while(tail >= head && qu[tail] >= arr[i])//check empth & new data is bigger than qu[tail]
			tail--;
		qu[++tail] = arr[i];
		indexx[tail] = i;
	}

	for (int i = K; i <= N; ++i)
	{
		while(tail >= head && qu[tail] >= arr[i])//check empth & new data is bigger than qu[tail]
			tail--;
		qu[++tail] = arr[i];
		indexx[tail] = i;
		while(indexx[head] <= i-K)
			head++;
		ans[i-K] = qu[head];
	}

	for (int i = 0; i <= N-K; ++i)
	{
		printf("%d ",ans[i]);
	}
	printf("\n");
}

void getmax()
{
	int tail = 0,head = 1;
	for (int i = 1; i < K; ++i)
	{
		while(tail >= head && qu[tail] <= arr[i])//check empth & new data is bigger than qu[tail]
			tail--;
		qu[++tail] = arr[i];
		indexx[tail] = i;
	}

	for (int i = K; i <= N; ++i)
	{
		while(tail >= head && qu[tail] <= arr[i])//check empth & new data is bigger than qu[tail]
			tail--;
		qu[++tail] = arr[i];
		indexx[tail] = i;

		while(indexx[head] <= i-K)
			head++;

		ans[i-K] = qu[head];

	}

	for (int i = 0; i <= N-K; ++i)
	{
		printf("%d ",ans[i]);
	}
	printf("\n");
}


int main()
{
	#ifdef DBG
	freopen("input.in","r",stdin);
	freopen("output.out","w",stdout);
	#endif

	while(~scanf("%d %d",&N,&K))
	{
		for (int i = 1; i <= N; ++i)
		{
			scanf("%d ",&arr[i]);
		}
		getmin();
		getmax();
	}


	return 0;

}