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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
#include <iostream>
#include <algorithm>
#include <vector>
//#include <gtest/gtest.h>
using std::vector;
int lcs3(vector<int> &a, vector<int> &b, vector<int> &c) {
int l = c.size();
int m = b.size();
int n = a.size();
int D[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] = std::max(D[i - 1][j][k],
std::max(D[i][j - 1][k], D[i][j][k - 1]));
}
}
}
}
return D[n][m][l];
}
//TEST(LCS3, t1) {
// vector<int> a = { 1, 2, 3 };
// vector<int> b = { 2, 1, 3 };
// vector<int> c = { 1, 3, 5 };
// ASSERT_EQ(2, lcs3(a, b, c));
//}
//
//TEST(LCS3, t2) {
// vector<int> a = { 8, 3, 2, 1, 7 };
// vector<int> b = { 8, 2, 1, 3, 8, 10, 7 };
// vector<int> c = { 6, 8, 3, 1, 4, 7 };
// ASSERT_EQ(3, lcs3(a, b, c));
//}
int main() {
size_t an;
std::cin >> an;
vector<int> a(an);
for (size_t i = 0; i < an; i++) {
std::cin >> a[i];
}
size_t bn;
std::cin >> bn;
vector<int> b(bn);
for (size_t i = 0; i < bn; i++) {
std::cin >> b[i];
}
size_t cn;
std::cin >> cn;
vector<int> c(cn);
for (size_t i = 0; i < cn; i++) {
std::cin >> c[i];
}
std::cout << lcs3(a, b, c) << std::endl;
}
|
