Cod sursa(job #934765)

Utilizator HellshadowTuca Laurentiu Hellshadow Data 31 martie 2013 14:01:18
Problema Cel mai lung subsir comun Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <iostream>
#include <cstdio>
#include <vector>

#define N 1024

using namespace std;

int a[N],b[N],d[N][N];

int main(){
  
  int m,n;
  freopen("cmlsc.in","r",stdin);
  freopen("cmlsc.out","w",stdout);
  
  cin>>n>>m;
  for(int i = 1;i <= n;i++)
    cin>>a[i];
  for(int i = 1;i <= m;i++)
    cin>>b[i];
  
  vector<int> sol;
  
  for(int i = 1;i <= n;i++)
    for(int j = 1;j <= m;j++)
      if(a[i] == b[j]){
	d[i][j] = 1 + d[i-1][j-1];
	sol.push_back(a[i]);
      }
      else 
	d[i][j] = max(d[i][j-1],d[i-1][j]);
  
  cout<<d[n][m]<<endl;
  for(int i = 0;i < sol.size()-1;i++)
    cout<<sol[i]<<" ";
  cout<<sol[sol.size()-1];
  
  return 0;
  
}