Pagini recente » Cod sursa (job #1742356) | Cod sursa (job #268278) | Monitorul de evaluare | Cod sursa (job #2801687) | Cod sursa (job #2530225)
#include <bits/stdc++.h>
using namespace std;
const int len = 2 << 9;
int m, n, a[len], b[len], dp[len][len];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
freopen("cmlsc.in", "r", stdin);
freopen("cmlsc.out", "w", stdout);
cin >> m >> n;
for (int i = 0; i < m; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i <= m; i++)
for (int j = 0; j <= n; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
else if (a[i] == b[j])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
cout << dp[m][n] << "\n";
}