动态规划拦截导弹问题

类似于最长递减子序列：

    public int interceptorMissle(int[] missle) {
        int[] dp = new int[missle.length];
        Arrays.fill(dp, 1);
        int max = 1;
        for (int i = 0; i < dp.length; i++) {
            for (int j = 0; j < i; j++) {
                if (missle[j] > missle[i])
                    dp[i] = Math.max(dp[i], dp[j]+1);
                max = dp[i] > max ? dp[i] : max;
            }
        }
        return max;
    }