Pagini recente » Cod sursa (job #2190095) | Cod sursa (job #2183615) | Cod sursa (job #1573981) | Cod sursa (job #1492434) | Cod sursa (job #1172210)
#include <fstream>
using namespace std;
#define DMAX 10//25
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n, m, vn[DMAX], vm[DMAX];
int C[DMAX][DMAX]; // lungimea
int B[DMAX][DMAX]; // directia
void write(int i, int j){
if (i * j == 0) return;
if (B[i][j] == 3){
write(i - 1, j - 1);
fout << vn[i] << ' ';
}
else if (B[i][j] == 2){
write(i - 1, j);
}
else{
write(i, j - 1);
}
}
int main(){
int i, j, cnt = 0;
fin >> n >> m;
for (i = 1; i <= n; i++) fin >> vn[i];
for (j = 1; j <= m; j++) fin >> vm[j];
for (i = 1; i <= n; i++){
for (j = 1; j <= m; j++){
if (vn[i] == vm[j]) {
C[i][j] = C[i - 1][j - 1] + 1;
B[i][j] = 3;
cnt++;
// sus-stanga
}
else if (C[i - 1][j] >= C[i][j - 1]){
C[i][j] = C[i - 1][j];
B[i][j] = 2;
//sus
}
else {
C[i][j] = C[i][j - 1];
B[i][j] = 1;
// stanga
}
}
}
fout << cnt << '\n';
write(n, m);
return 0;
}