Pagini recente » Cod sursa (job #1714849) | Cod sursa (job #1371068) | Cod sursa (job #2565253) | Cod sursa (job #3174628) | Cod sursa (job #818747)
Cod sursa(job #818747)
#include<fstream>
using namespace std;
// declarations
const int LEN = 1025;
int N,M,a[LEN],b[LEN], mat[LEN][LEN];
int check(int x, int y){
return (x > y) ? x : y;
}
int cmlsc(){
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
if(a[i-1] == b[j-1]){
mat[i][j] = mat[i-1][j-1] + 1;
}
else mat[i][j] = check(mat[i][j-1], mat[i-1][j]);
}
}
return mat[N][M];
}
int main()
{
int i,j,sir[LEN],k=0;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
fin >> N >> M;
for(i = 0; i < N; i++){
fin >> a[i];
mat[i][0] = 0;
}
mat[N][0] = 0;
for(i = 0; i < M; i++){
fin >> b[i];
mat[0][i] = 0;
}
mat[0][M] = 0;
fout << cmlsc() <<"\n";
for(i = N, j = M; j && i;){
if(a[i-1] == b[j-1]){
sir[k] = a[i-1];
k++;
i--;
j--;
}
else if(mat[i-1][j] < mat[i][j-1]) j--;
else i--;
}
for(i = k-1; i >= 0; i--){
fout << sir[i] <<" ";
}
fin.close();
fout.close();
return 0;
}