-
Notifications
You must be signed in to change notification settings - Fork 0
/
Deque-STL.cpp
71 lines (55 loc) · 1.37 KB
/
Deque-STL.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
61
62
63
64
65
66
67
68
69
70
71
#include <iostream>
#include <deque>
using namespace std;
void printKMax(int arr[], int n, int k){
deque<int> dq;
for (int i=0; i<n; i++){
// base case for first element
if (dq.empty()){
dq.push_back(i);
}
// remove elements outside the current window
if (dq.front() <= (i - k)){
dq.pop_front();
}
// move max element to the front
while (!dq.empty() && arr[i] >= arr[dq.back()]){
dq.pop_back();
}
dq.push_back(i);
// print out only when the first window is completed
if (i >= (k - 1)){
cout << arr[dq.front()] << " ";
}
}
cout << endl;
}
int main(){
int t;
cin >> t;
while(t>0) {
int n,k;
cin >> n >> k;
int i;
int arr[n];
for(i=0;i<n;i++)
cin >> arr[i];
printKMax(arr, n, k);
t--;
}
return 0;
}
/*
Sample Input
2
5 2
3 4 6 3 4
7 4
3 4 5 8 1 4 10
Sample Output
4 6 6 4
8 8 8 10
Explanation
For the first case, the contiguous subarrays of size 2 are {3,4},{4,6},{6,3} and {3,4}. The 4 maximum elements of subarray of size 2 are: 4 6 6 4.
For the second case,the contiguous subarrays of size 4 are {3,4,5,8},{4,5,8,1},{5,8,1,4} and {8,1,4,10}. The 4 maximum element of subarray of size 4 are: 8 8 8 10.
*/