Pagini recente » Cod sursa (job #1501354) | Cod sursa (job #2267109) | Cod sursa (job #2376133) | Cod sursa (job #2953787) | Cod sursa (job #1999368)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int main() {
int n, m;
cin >> n >> m;
vector< int > v1(n + 1);
vector< int > v2(n + 1);
for(int i = 1; i <= n; i ++)
cin >> v1[i];
for(int i = 1; i <= m; i ++)
cin >> v2[i];
vector< vector< int > > dp(n + 1, vector< int >(m + 1, 0));
vector< int > sol;
vector< bool > used(n + 1, false);
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= m; j ++){
if(v1[i] == v2[j]){
dp[i][j] = dp[i - 1][j - 1] + 1;
if(!used[i]) {
sol.push_back(i);
used[i] = true;
}
}
else
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
}
cout << dp[n][m] << '\n';
for(auto x : sol)
cout << v1[x] << ' ';
cout << '\n';
}