-
Notifications
You must be signed in to change notification settings - Fork 47
/
bitonic.java
54 lines (46 loc) · 1.23 KB
/
bitonic.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
class Main
{
public static void findBitonicSubarray(int[] A)
{
if (A.length == 0) {
return;
}
int[] I = new int[A.length];
I[0] = 1;
for (int i = 1; i < A.length; i++)
{
I[i] = 1;
if (A[i - 1] < A[i]) {
I[i] = I[i - 1] + 1;
}
}
int[] D = new int[A.length];
D[A.length - 1] = 1;
for (int i = A.length - 2; i >= 0; i--)
{
D[i] = 1;
if (A[i] > A[i + 1]) {
D[i] = D[i + 1] + 1;
}
}
int lbs_len = 1;
int beg = 0, end = 0;
for (int i = 0; i < A.length; i++)
{
int len = I[i] + D[i] - 1;
if (lbs_len < len)
{
lbs_len = len;
beg = i - I[i] + 1;
end = i + D[i] - 1;
}
}
System.out.println("The length of the longest bitonic subarray is " + lbs_len);
System.out.printf("The longest bitonic subarray indices are [%d, %d]", beg, end);
}
public static void main(String[] args)
{
int[] A = { 3, 5, 8, 4, 5, 9, 10, 8, 5, 3, 4 };
findBitonicSubarray(A);
}
}