2000:最长公共子上升序列（OJ）（JAVA）

 

目录

 

1.题目介绍：​编辑

 2.Java答案：

3.解析： 

4.原理：

---

1.题目介绍：

---

 2.Java答案：

import java.util.ArrayList;
import java.util.Scanner;

public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n1 = sc.nextInt();
        int[] s1 = new int[n1 + 1];
        for (int i = 1; i <= n1; i++) {
            s1[i] = sc.nextInt();
        }
        int n2 = sc.nextInt();
        int[] s2 = new int[n2 + 1];
        for (int i = 1; i <= n2; i++) {
            s2[i] = sc.nextInt();
        }
        int[] len = new int[n2 + 1];
        ArrayList<Integer>[] sub = new ArrayList[n2 + 1];
        for (int i = 0; i <= n2; i++) {
            sub[i] = new ArrayList<>();
        }
        for (int i = 1; i <= n1; i++) {
            int e1 = s1[i];
            int best = 0;
            for (int j = 1; j <= n2; j++) {
                if (s2[j] < e1 && len[j] > len[best]) {
                    best = j;
                }
                if (e1 == s2[j]) {
                    len[j]