forked from ds-sww/codebase
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sliding-window-old.cpp
60 lines (51 loc) · 1.06 KB
/
sliding-window-old.cpp
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 <cstring>
using namespace std;
const int N = 1011111;
int segMax[N][20];
int segMin[N][20];
int qMax(int left, int right)
{
int log2 = 31 - __builtin_clz(right - left);
return max(segMax[left][log2], segMax[right - (1 << log2)][log2]);
}
int qMin(int left, int right)
{
int log2 = 31 - __builtin_clz(right - left);
return min(segMin[left][log2], segMin[right - (1 << log2)][log2]);
}
int main()
{
int n, k;
scanf("%d%d", &n, &k);
for(int i = 0; i < n; i++)
{
scanf("%d", segMin[i]);
segMax[i][0] = segMin[i][0];
}
for(int j = 1; j < 20; j++)
for(int i = 0; i < n; i++)
{
if(i + (1 << (j - 1)) < n)
{
segMax[i][j] = max(segMax[i][j - 1], segMax[i + (1 << (j - 1))][j - 1]);
segMin[i][j] = min(segMin[i][j - 1], segMin[i + (1 << (j - 1))][j - 1]);
}
}
for(int i = 0; i < n - k + 1; i++)
{
if(i)
printf(" ");
printf("%d", qMin(i, i + k));
}
printf("\n");
for(int i = 0; i < n - k + 1; i++)
{
if(i)
printf(" ");
printf("%d", qMax(i, i + k));
}
printf("\n");
return 0;
}