Pagini recente » Cod sursa (job #211403) | Cod sursa (job #267237) | Cod sursa (job #159859) | Cod sursa (job #1205504) | Cod sursa (job #1414162)
#include <fstream>
#define NMax 1025
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int m, n, v1[NMax], v2[NMax], d[2][NMax], rec[NMax], k;
int getmax(int a, int b)
{
if (a > b)
return a;
return b;
}
int main()
{
f >> m >> n;
for (int i = 1; i <= m; i++)
f >> v1[i];
for (int i = 1; i <= n; i++)
f >> v2[i];
int ind = 1;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (v1[i] == v2[j])
d[ind][j] = d[1 - ind][j - 1] + 1;
else
d[ind][j] = getmax(d[1 - ind][j], d[ind][j - 1]);
}
ind = 1 - ind;
}
g << d[1 - ind][n] << "\n";
int i = m, j = n, len = d[1 - ind][n], cl = len;
ind = 1 - ind;
while (len > 0) {
if (v1[i] == v2[j]) {
rec[len] = v1[i];
i--;
j--;
ind = 1 - ind;
len--;
}
else {
if (d[1 - ind][j] > d[ind][j - 1]) {
i--;
ind = 1 - ind;
}
else
j--;
}
}
for (int i = 1; i <= cl; i++)
g << rec[i] << " ";
}