Pagini recente » Cod sursa (job #1920412) | Cod sursa (job #2949632) | Cod sursa (job #167230) | Cod sursa (job #1853987) | Cod sursa (job #1316613)
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int SCM[1025][1025];
int V[1025], W[1025];
int m, n;
int main() {
fin>>m>>n;
for(int i=1; i<=m; i++) {
fin>>V[i];
}
for(int i=1; i<=n; i++) {
fin>>W[i];
}
for(int i=1; i<=m; i++) {
for(int j=1; j<=n; j++) {
if(V[i] == W[j])
SCM[i][j] = 1 + SCM[i-1][j-1];
else
SCM[i][j] = max(SCM[i-1][j], SCM[i][j-1]);
}
}
fout<<SCM[m][n]<<'\n';
int i=1, j=1;
while(i<=m||j<=n) {
while(SCM[i][j] == SCM[i+1][j]) i++;
while(SCM[i][j] == SCM[i][j+1]) j++;
if(i<m)
fout<<V[i+1]<<" ";
i++;
j++;
}
}