three jumps

three_jumps_solution.cpp

int test() {
        // initalize dp[i][0] with 1
        // dp[index][jumps_used]
        result = 0;
        for(int i = 0; i < n; ++i) {
            for(int j = 0; j <= 3; ++j) {
                for(int k = 1; k <= 3; ++k) {
                    if( i - k >= 0 and v[i] == v[i - k] and j - k >= 0) {
                        dp[i][j] = max(dp[i][j], 1 + k + dp[i - k][j - k)]);
                    }
                    if( j + 1 == k) {
                        dp[i][j] = max(dp[i][j], k);
                    }
                }
                result = max(result, dp[i][j]);
            }
        }
    }