第一题,最长上升子序列 public static int LSubSequence (int N, ArrayList<Integer> sequence) { // write code here int[] dp = new int[N]; Arrays.fill(dp,1); int max=1; for (int i = 0; i < sequence.size(); i++) { for (int j = 0; j < i; j++) { ...