-
Notifications
You must be signed in to change notification settings - Fork 43
/
Sliding_Window_In_Java.java
51 lines (41 loc) · 1.59 KB
/
Sliding_Window_In_Java.java
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
import java.io.*;
import java.util.*;
public class Sliding_Window {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int[] a = new int[n]; // declaring array a
for (int i = 0; i < n; i++) {
a[i] = Integer.parseInt(br.readLine()); //Taking input if array element
}
int k = Integer.parseInt(br.readLine()); //Taking input of element k
System.out.println("Answer is: ");
Stack<Integer> stack = new Stack<>();
int[] ans = new int[a.length];
stack.push(a.length - 1);
ans[a.length - 1] = a.length;
// finding next greater element in the array..
for(int i = a.length - 2; i >= 0; i--) {
while(stack.size() > 0 && a[i] >= a[stack.peek()]){
stack.pop();
}
if(stack.size() == 0){
ans[i] = a.length;
} else{
ans[i] = stack.peek();
}
stack.push(i);
}
// finding the maximum element in the sliding window
int j = 0;
for(int i=0; i <= a.length - k; i++){
if(j<i){
j = i;
}
while(ans[j] < i + k){
j = ans[j];
}
System.out.println(a[j]);
}
}
}