blob: 30ad31feb79fed297fd07e0d32d8cc4057f4b427 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
import java.util.Scanner;
public class LCS3 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int an = scanner.nextInt();
int[] a = new int[an];
for (int i = 0; i < an; i++) {
a[i] = scanner.nextInt();
}
int bn = scanner.nextInt();
int[] b = new int[bn];
for (int i = 0; i < bn; i++) {
b[i] = scanner.nextInt();
}
int cn = scanner.nextInt();
int[] c = new int[cn];
for (int i = 0; i < cn; i++) {
c[i] = scanner.nextInt();
}
System.out.println(lcs3(a, b, c));
}
public static int lcs3(int[] a, int[] b, int[] c) {
int l = c.length;
int m = b.length;
int n = a.length;
int[][][] D = new int[n + 1][m + 1][l + 1];
for (int k = 0; k < l + 1; k++) {
for (int j = 0; j < m + 1; j++) {
for (int i = 0; i < n + 1; i++) {
if (i == 0 || j == 0 || k == 0) {
D[i][j][k] = 0;
continue;
}
if (a[i - 1] == b[j - 1] && b[j - 1] == c[k - 1]) {
D[i][j][k] = D[i - 1][j - 1][k - 1] + 1;
} else {
D[i][j][k] = Math.max(D[i - 1][j][k], Math.max(D[i][j - 1][k], D[i][j][k - 1]));
}
}
}
}
return D[n][m][l];
}
}
|