forked from alexprut/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
73 lines (54 loc) · 1.8 KB
/
Solution.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
69
70
71
72
73
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 serviceLane function below.
static int[] serviceLane(int n, int[][] cases, int[] width) {
int[] result = new int[cases.length];
for (int i = 0; i < cases.length; i++) {
int min = 3;
for (int j = cases[i][0]; j <= cases[i][1]; j++) {
min = Math.min(min, width[j]);
}
result[i] = min;
}
return result;
}
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")));
String[] nt = scanner.nextLine().split(" ");
int n = Integer.parseInt(nt[0]);
int t = Integer.parseInt(nt[1]);
int[] width = new int[n];
String[] widthItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int widthItem = Integer.parseInt(widthItems[i]);
width[i] = widthItem;
}
int[][] cases = new int[t][2];
for (int i = 0; i < t; i++) {
String[] casesRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int j = 0; j < 2; j++) {
int casesItem = Integer.parseInt(casesRowItems[j]);
cases[i][j] = casesItem;
}
}
int[] result = serviceLane(n, cases, width);
for (int i = 0; i < result.length; i++) {
bufferedWriter.write(String.valueOf(result[i]));
if (i != result.length - 1) {
bufferedWriter.write("\n");
}
}
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}