-
Notifications
You must be signed in to change notification settings - Fork 0
/
B_66.java
53 lines (48 loc) · 1.52 KB
/
B_66.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
package Ladder_B;
/**
* Created by Eesaa on 9/28/2017.
*/
import java.util.*;
public class B_66 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
ArrayList<Integer> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
list.add(in.nextInt());
}
if (n == 1 || n == 2) {
System.out.println(n);
return;
}
ArrayList<Integer> ranges = new ArrayList<>();
for (int i = 0; i < n; i++) {
ranges.add(reached(list, i));
}
System.out.println(Collections.max(ranges));
}
public static int reached(ArrayList<Integer> list, int index) {
int res = 1;
if (index == list.size() - 1) {
for (int i = list.size() - 1; i > 0; --i) {
if (list.get(i) >= list.get(i - 1)) res++;
else break;
}
} else if (index == 0) {
for (int i = 0; i < list.size() - 1; i++) {
if (list.get(i) >= list.get(i + 1)) res++;
else break;
}
} else {
for (int i = index; i > 0; i--) {
if (list.get(i) >= list.get(i - 1)) res++;
else break;
}
for (int i = index; i < list.size() - 1; i++) {
if (list.get(i) >= list.get(i + 1)) res++;
else break;
}
}
return res;
}
}