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
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1e6+10;
int n, k;
int a[N];
int q[N];
void getMin() {
int head = 0, tail = 0;
for (int i = 1; i < k; i++) {
while(head <= tail && a[q[tail]] >= a[i]) {
tail--;
}
q[++tail] = i;
}
for (int i = k; i <= n; i++) {
while(head <= tail && a[q[tail]] >= a[i]) {
tail--;
}
q[++tail] = i;
while (q[head] <= i-k) {
head++;
}
printf("%d ", a[q[head]]);
}
printf("\n");
}
void getMax() {
int head = 0, tail = 0;
for(int i = 1; i < k; i++) {
while(head <= tail && a[q[tail]] <= a[i]) tail--;
q[++tail] = i;
}
for(int i = k; i <= n; i++) {
while(head <= tail && a[q[tail]] <= a[i]) tail--;
q[++tail] = i;
while(q[head] <= i-k) head++;
printf("%d ", a[q[head]]);
}
printf("\n");
}
int main() {
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
getMin();
getMax();
return 0;
}
|
