Pagini recente » Cod sursa (job #1625618) | Cod sursa (job #1369640) | Cod sursa (job #48827) | Cod sursa (job #2230631) | Cod sursa (job #2050645)
#include <iostream>
#include <fstream>
#include <cmath>
#define DM 1024
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int dp[DM][DM], n, m, v1[DM], v2[DM], rez[DM], c;
//int maxx = -1;
void din()
{
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
if(v1[i]==v2[j])
dp[i][j] = max(dp[i - 1][j], max(dp[i - 1][j - 1] + 1, dp[i][j - 1])), rez[++c] = v1[i];
else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; i++)
fin >> v1[i];
for(int i = 1; i <= m; i++)
fin >> v2[i];
din();
fout << dp[n][m];
return 0;
}