The best of an array having N elements is defined as sum of best of all elements of Array. The best of element A[i] is defined in the following manner

a: The best of element A[i] is 1 if, A[i-1]<A[i]<A[i+1]
b: The best of element A[i] is 2 if, A[i]> A[j] for j ranging from 0 to n-1
and A[i]<A[h] for h ranging from i+1 to N-1
Write program to find best of array

Note- A[0] and A[N-1] are excluded to find best of array, all elements are unique

Input - 2,1,3,9,20,7,8

Output - 3

The best of element 3 is 2 and 9 is 1. For rest element it is 0. Hence 2+1 =3

This is what I tried so far -

public static void main (String [] args) {

int [] A = {2,1,3,9,20,7,8};

int result = 0;

for(int i=1; i<A.length-2; i++) {
if(A[i-1] < A[i] && A[i]< A[i+1] ) {
result += 1;
}else if(A[i]>A[j] && A[i]<A[h]){
result +=2;
}
else {result+=0;}
}
}