题目链接
线性动态规划
1.
f
[
i
]
[
j
]
f[i][j]
f[i][j]表示
a
[
i
.
.
.
n
]
a[i...n]
a[i...n] 与
b
[
j
.
.
.
m
]
b[j...m]
b[j...m] 的最长公共子序列。属性表示最长公共子序列长度。
2.状态转移:
状态计算只要不影响答案可以重复计算,
a
[
i
+
1
]
a[i+1]
a[i+1] ~
a
[
n
]
a[n]
a[n] 与
b
[
j
]
b[j]
b[j] ~
b
[
m
]
b[m]
b[m]的最长公共子序列 和
a
[
i
]
a[i]
a[i] ~
a
[
n
]
a[n]
a[n] 与
b
[
j
+
1
]
b[j+1]
b[j+1] ~
b
[
m
]
b[m]
b[m] 的最长公共子序列取最大值,发现覆盖了
a
[
i
]
a[i]
a[i] 与
b
[
j
]
b[j]
b[j] 都不选的情况,当
a
[
i
]
a[i]
a[i] 与
b
[
j
]
b[j]
b[j] 都选的情况
f
[
i
]
[
j
]
f[i][j]
f[i][j] =
m
a
x
max
max(
f
[
i
]
[
j
]
f[i][j]
f[i][j],
f
[
i
+
1
]
[
j
+
1
]
+
1
f[i+1][j+1]+1
f[i+1][j+1]+1),从后往前覆盖,最终答案就是
f
[
0
]
[
0
]
f[0][0]
f[0][0]
class Solution {
public:
int f[507][507];
int maxUncrossedLines(vector<int>& a, vector<int>& b) {
int n = a.size();
int m = b.size();
memset(f, 0, sizeof f);
for(int i = n-1; ~i; i--)
{
for(int j = m-1; ~j; j--)
{
f[i][j] = max(f[i+1][j],f[i][j+1]);
if(a[i] == b[j]) f[i][j] = max(f[i][j],f[i+1][j+1] + 1);
}
}
return f[0][0];
}
};