### 第21题

**阅读程序（二）**（下列程序供第 21~26 题使用；判断题正确填√，错误填×）

```cpp
01 #include <iostream>
02 #include <string>
03 #include <algorithm>
04 using namespace std;
05
06 int dp[1005][1005];
07
08 int solve(string s1, string s2) {
09 int n = s1.length();
10 int m = s2.length();
11 for (int i = 0; i <= n; i++) dp[i][0] = 0;
12 for (int j = 0; j <= m; j++) dp[0][j] = 0;
13
14 for (int i = 1; i <= n; i++) {
15 for (int j = 1; j <= m; j++) {
16 if (s1[i - 1] == s2[j - 1]) {
17 dp[i][j] = dp[i - 1][j - 1] + 1;
18 } else {
19 dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
20 }
21 }
22 }
23 return dp[n][m];
24 }
25
26 int main() {
27 string s1, s2;
28 cin >> s1 >> s2;
29 cout << solve(s1, s2) << endl;
30 return 0;
31 }
```

**判断题**：该程序实现了求两个字符串的**最长公共子串**（Continuous Substring）长度的功能。（　）