-
Notifications
You must be signed in to change notification settings - Fork 1
/
LCS3.java
41 lines (37 loc) · 1.31 KB
/
LCS3.java
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
import java.util.*;
public class LCS3 {
private static int lcs3(int[] a, int[] b, int[] c) {
int[][][] res = new int[a.length + 1][b.length + 1][c.length + 1];
for (int i = 1; i <= a.length; i++) {
for (int j = 1; j <= b.length; j++) {
for( int k = 1; k <= c.length; k++){
if (a[i - 1] == b[j - 1] && b[j - 1] == c[k - 1]){
res[i][j][k] = 1 + res[i - 1][j - 1][k - 1];
} else {
res[i][j][k] = Math.max(res[i - 1][j][k], Math.max(res[i][j - 1][k], res[i][j][k - 1]));
}
}
}
}
return res[a.length][b.length][c.length];
}
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));
}
}