Pagini recente » Cod sursa (job #2393317) | Cod sursa (job #2639426) | Cod sursa (job #2537809) | Cod sursa (job #801174) | Cod sursa (job #2954152)
/*
Testez diferite chestii
*/
#include <bits/stdc++.h>
#define NMAX 1024
using namespace std;
ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");
int a[NMAX + 1];
int b[NMAX + 1];
int dp[NMAX + 1][NMAX + 1];
void afisareDP(int x, int y){
if(y == 0){
return;
}
if(a[x] == b[y]){
afisareDP(x - 1, y - 1);
fout << a[x] << ' ';
}
else if(dp[x - 1][y] == dp[x][y]){
afisareDP(x - 1, y);
}
else {
afisareDP(x, y - 1);
}
}
int main()
{
int N, M;
fin >> N >> M;
for(int i = 1; i <= N; i++){
fin >> a[i];
}
for(int j = 1; j <= M; j++){
fin >> b[j];
}
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;
}
else {
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
}
}
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M - 1; j++){
if(dp[i][j] <= dp[i][j + 1] - 2){
return -1;
}
}
}
for(int i = 1;i <= N - 1; i++){
for(int j = 1; j <= N; j++){
if(dp[i][j] <= dp[i + 1][j] - 2){
return -1;
}
}
}
fout << dp[N][M] << "\n";
afisareDP(N, M);
return 0;
}