975. Odd Even Jump

You are given an integer array A. From some starting index, you can make a series of jumps. The (1st, 3rd, 5th, …) jumps in the series are called odd numbered jumps, and the (2nd, 4th, 6th, …) jumps in the series are called even numbered jumps.

You may from index i jump forward to index j (with i < j) in the following way:

During odd numbered jumps (ie. jumps 1, 3, 5, …), you jump to the index j such that A[i] <= A[j] and A[j] is the smallest possible value. If there are multiple such indexes j, you can only jump to the smallest such index j.
During even numbered jumps (ie. jumps 2, 4, 6, …), you jump to the index j such that A[i] >= A[j] and A[j] is the largest possible value. If there are multiple such indexes j, you can only jump to the smallest such index j.
(It may be the case that for some index i, there are no legal jumps.)
A starting index is good if, starting from that index, you can reach the end of the array (index A.length - 1) by jumping some number of times (possibly 0 or more than once.)

Return the number of good starting indexes.

Example 1:

Input: [10,13,12,14,15]
Output: 2
Explanation:
From starting index i = 0, we can jump to i = 2 (since A[2] is the smallest among A[1], A[2], A[3], A[4] that is greater or equal to A[0]), then we can’t jump any more.
From starting index i = 1 and i = 2, we can jump to i = 3, then we can’t jump any more.
From starting index i = 3, we can jump to i = 4, so we’ve reached the end.
From starting index i = 4, we’ve reached the end already.
In total, there are 2 different starting indexes (i = 3, i = 4) where we can reach the end with some number of jumps.
Example 2:

Input: [2,3,1,1,4]
Output: 3
Explanation:
From starting index i = 0, we make jumps to i = 1, i = 2, i = 3:

During our 1st jump (odd numbered), we first jump to i = 1 because A[1] is the smallest value in (A[1], A[2], A[3], A[4]) that is greater than or equal to A[0].

During our 2nd jump (even numbered), we jump from i = 1 to i = 2 because A[2] is the largest value in (A[2], A[3], A[4]) that is less than or equal to A[1]. A[3] is also the largest value, but 2 is a smaller index, so we can only jump to i = 2 and not i = 3.

During our 3rd jump (odd numbered), we jump from i = 2 to i = 3 because A[3] is the smallest value in (A[3], A[4]) that is greater than or equal to A[2].

We can’t jump from i = 3 to i = 4, so the starting index i = 0 is not good.

In a similar manner, we can deduce that:
From starting index i = 1, we jump to i = 4, so we reach the end.
From starting index i = 2, we jump to i = 3, and then we can’t jump anymore.
From starting index i = 3, we jump to i = 4, so we reach the end.
From starting index i = 4, we are already at the end.
In total, there are 3 different starting indexes (i = 1, i = 3, i = 4) where we can reach the end with some number of jumps.
Example 3:

Input: [5,1,3,4,2]
Output: 3
Explanation:
We can reach the end from starting indexes 1, 2, and 4.

Note:

1. 1 <= A.length <= 20000
2. 0 <= A[i] < 100000

方法0: brute force

思路：

jump的规则是determined function，不需要做决策，从每个位置开始向后遍历O(n)即可找到解。

Complexity

Time complexity: O(n^2)
Space complexity: O(1)

方法1: treemap + dynamic programming

思路：

关键在于如何把内层循环加速。由于至少要遍历一次数组，不可能小于O(n),最优复杂度最可能的就是O(nlogn)，所以利用binary search。for odd jump: find the first to the right that is greater or equal to self. for odd jump: find the first to the right that is smaller or equal to self. 从后向前遍历，找到nums[i], map里面存的predecessor/successor的index。此时判断是否找到，如果没有找到直接false，否则从该predecessor/successor的位置转移反向跳的状态。初始将最后位置的两种状态都设为true，毕竟怎么跳都能到。在反向遍历的过程中不断stream in，并且累计up。在查找的时候可以用lower_bound和upper_bound，注意是否包括自己。

dp：1. up(n, 1): 是否能通过上升跳reach end，2. down(n, 1): 能否通过下降跳reach end。
initialize: up[n - 1] = 1, down[n - 1] = 1。
transfer：如果找不到predecessor/successor, 可以直接设为false；否则up[i] = down[successor], down[i] = up[predecessor]。
return：accumulate(up.begin(), up.end())。起步必须上升跳。

Complexity

Time complexity: O(n log n)
Space complexity: O(n)

class Solution {
public:
    int oddEvenJumps(vector<int>& A) {
        map<int, int> hash;
        int n = A.size(), res = 1;
        hash[A.back()] = n - 1;
        vector<int> up(n, 1);
        vector<int> down(n, 1);
        for (int i = n - 2; i >= 0; i--) {
            auto it_up = hash.lower_bound(A[i]);
            if (it_up == hash.end()) up[i] = 0;
            else up[i] = down[it_up -> second];
            
            auto it_down = hash.upper_bound(A[i]);
            if (it_down == hash.begin()) down[i] = 0;
            else down[i] = up[prev(it_down) -> second];
            
            hash[A[i]] = i;
            res += up[i];
        }
        
        return res;
    }
};