forked from rudi8848/data_structures
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1.5.window.c
More file actions
123 lines (100 loc) · 1.7 KB
/
1.5.window.c
File metadata and controls
123 lines (100 loc) · 1.7 KB
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#include <iostream>
#include <stack>
#include <vector>
#include <utility>
/* std::pair(val, max)*/
struct MaxStack
{
void push(int val) {
_st.empty() ? _st.push(std::make_pair(val, val))
: _st.push(std::make_pair(val, std::max(val, _st.top().second)));
}
void pop() {
if (!_st.empty())
_st.pop();
}
int max() {
if (!_st.empty())
return _st.top().second;
else
return -1;
}
int top() {
if (!_st.empty())
return _st.top().first;
else
return -1;
}
bool empty() { return _st.empty(); }
int size() { return _st.size(); }
private:
std::stack <std::pair<int, int>> _st;
};
struct MaxQueue
{
void push(int val) { _left.push(val); }
void pop() {
if (_right.empty())
{
int size = _left.size();
for (int i = 0; i < size; ++i)
{
int tmp = _left.top();
_left.pop();
_right.push(tmp);
}
}
_right.pop();
}
int max() {
if (_right.empty())
{
int size = _left.size();
for (int i = 0; i < size; ++i)
{
int tmp = _left.top();
_left.pop();
_right.push(tmp);
}
}
return std::max(_right.max(), _left.max());
}
int size() {
return _left.size() + _right.size();
}
private:
MaxStack _left;
MaxStack _right;
};
int main(void)
{
int n, win;
std::cin >> n;
std::vector<int> input(n);
for (int i = 0; i < n; ++i)
std::cin >> input[i];
std::cin >> win;
int outsize = n - win + 1;
std::vector<int> output (outsize);
MaxQueue q;
int i = 0;
int j = 0;
while (i < win)
{
q.push(input[i]);
++i;
}
output[j] = q.max();
++j;
while (i < n)
{
q.pop();
q.push(input[i]);
output[j] = q.max();
++j;
++i;
}
for (int i = 0; i < output.size(); ++i)
std::cout << output[i] << " ";
return 0;
}