975. Odd Even Jump

class Solution {
    public int oddEvenJumps(int[] A) {
        int n = A.length;
        TreeMap<Integer, Integer> map = new TreeMap<>();
        map.put(A[n - 1], n - 1);
        
        boolean[] odd = new boolean[n];
        boolean[] even = new boolean[n];
        odd[n - 1] = true;
        even[n - 1] = true;
        
        for (int i = n - 2; i >= 0; i--) {
            Map.Entry oddEntry = map.ceilingEntry(A[i]), evenEntry = map.floorEntry(A[i]);
            
            if (oddEntry != null) {
                odd[i] = even[(int) oddEntry.getValue()];            
            }
            
            if (evenEntry != null) {
                even[i] = odd[(int) evenEntry.getValue()];
            }
            
            map.put(A[i], i);
        }
        
        int res = 0;
        for (boolean b : odd) {
            if (b) res++;
        }
        
        return res;
    }
}