-
Notifications
You must be signed in to change notification settings - Fork 77
/
MinMaxRiddle.java
68 lines (50 loc) · 1.62 KB
/
MinMaxRiddle.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the riddle function below.
static long[] riddle(long[] arr) {
// complete this function
int length = arr.length;
long[] res = new long[length];
int step = 1;
while (step <= length) {
long min = arr[step-1];
for (int j = step - 1, k = 0; j < length; j++, k++) {
min = Math.min(min, arr[j]);
if(res[k] < min) {
res[k] = min;
}
}
step++;
}
return res;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
long[] arr = new long[n];
String[] arrItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
long arrItem = Long.parseLong(arrItems[i]);
arr[i] = arrItem;
}
long[] res = riddle(arr);
for (int i = 0; i < res.length; i++) {
bufferedWriter.write(String.valueOf(res[i]));
if (i != res.length - 1) {
bufferedWriter.write(" ");
}
}
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}