Pagini recente » Cod sursa (job #108482) | Cod sursa (job #127122) | Cod sursa (job #458599) | Rating B Vlad (BVlad) | Cod sursa (job #2543655)
#include <bits/stdc++.h>
#define nl '\n'
using namespace std;
short um[1026][1026], a[1026], b[1026];
int main(){
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; ++i)
cin >> a[i];
for(int i = 1; i <= m; ++i)
cin >> b[i];
++n, ++m;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
if(a[i - 1] == b[j - 1])
um[i][j] = um[i - 1][j - 1] + 1;
else
um[i][j] = max(um[i - 1][j], um[i][j - 1]);
int i = n, j = m;
stack<short> st;
while(i > 1 && j > 1){
if(a[i - 1] == b[j - 1])
st.push(a[i - 1]), --i, --j;
else if(um[i - 1][j] > um[i][j - 1])
--i;
else
--j;
}
cout << st.size() << nl;
while(st.size())
cout << st.top() << ' ', st.pop();
cin.close(), cout.close();
}