public static int findLongest(int[] A) { int[] dp = new int[A.length]; int[] help = new int[A.length]; help[0] = A[0]; dp[0] = 1; int l = 0; int r = 0; int m = 0; int right = 0; for (int i = 1; i < A.length; i++) { l = 0; r = right; while (l <= r) { m = (l + r) / 2; if (A[i] > help[m]) { l = m + 1; } else { r = m - 1; } } right = Math.max(right, l); help[l] = A[i]; dp[i] = l + 1; } return dp[n-1]; } 怎么测试都不对！