-
Notifications
You must be signed in to change notification settings - Fork 0
/
1045.cpp
58 lines (51 loc) · 969 Bytes
/
1045.cpp
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
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<int> stripeA, stripeB;
int lcs_length[205][10005];
int LCS()
{
int maxlen = 0;
for (int i = 0; i != stripeA.size(); ++i)
{
lcs_length[i][0] = 0;
}
for (int i = 0; i != stripeB.size(); ++i)
{
lcs_length[0][i] = 0;
}
for (int i = 1; i < stripeA.size(); ++i)
{
for (int j = 1; j < stripeB.size(); ++j)
{
maxlen = lcs_length[i-1][j] > lcs_length[i][j-1] ? lcs_length[i-1][j] : lcs_length[i][j-1];
//maxlen = maxlen > lcs_length[i-1][j-1] ? maxlen : lcs_length[i-1][j-1];
if (stripeA[i] == stripeB[j])
{
++maxlen;
}
lcs_length[i][j] = maxlen;
}
}
return maxlen;
}
int main()
{
int length;
cin >> N;
cin >> length;
stripeA.resize(length+1);
for (int i = 1; i != length+1; ++i)
{
cin >> stripeA[i];
}
cin >> length;
stripeB.resize(length+1);
for (int i = 1; i != length+1; ++i)
{
cin >> stripeB[i];
}
cout << LCS() << endl;
return 0;
}