Pagini recente » Cod sursa (job #2170292) | Cod sursa (job #194186) | Cod sursa (job #767335) | Cod sursa (job #785661) | Cod sursa (job #1205786)
#include <fstream>
#include <vector>
using namespace std;
int dp[1030][1030], n, m, a[1030], b[1030], lung_max;
vector<int> sol;
int main()
{
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
cin >> n >> m;
for (int i = 1; i <= n; i ++)
cin >> a[i];
for (int i = 1; i <= m; i ++)
cin >> b[i];
for (int i = 1; i <= n; i ++)
for (int j = 1; j <= m; j ++)
if (a[i] == b[j])
{
dp[i][j] = dp[i-1][j-1] + 1;
lung_max ++;
sol.push_back(a[i]);
}
else
dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
cout << lung_max << '\n';
for (int i = 0; i < sol.size(); i ++)
cout << sol[i] << " ";
return 0;
}