public int jump_lint(int[] A) {
        // write your code here
        if (A == null || A.length == 0 || A[0] == 0)
            return 0;
        int[] dp = new int[A.length];
        dp[0] = 1;
        for (int i = 1; i < A.length; ++i) {
            int min = Integer.MAX_VALUE;
            for (int j = 0; j < i; ++j) {
                if (A[j] + j >= i) {
                    min = Math.min(min, dp[j] + 1);
                }
            }
            dp[i] = min;
        }
        return dp[A.length - 1];
    }