Pagini recente » Cod sursa (job #3171271) | Cod sursa (job #3277990)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
vector <int> a(1025) , b(1025);
int n, m, dp[1025][1025];
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; i++)
fin >> a[i];
for(int j = 1; j <= m; j++)
fin >> b[j];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
{
if(a[i] == b[j])
dp[i][j] = 1 + dp[i - 1][j - 1];
else dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
fout << dp[n][m];
return 0;
}