Cod sursa(job #1342281)
| Utilizator | Data | 13 februarie 2015 19:00:51 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
int max(int x,int y)
{
if(x>y) return x;
else return y;
}
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int main()
{
int a[100],b[100],n,m,i,j,c[100][100],v[100],p=1;
cin>>n>>m;
for(i=1;i<=n;++i) cin>>a[i];
for(j=1;j<=m;++j) cin>>b[j];
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
if( a[i] == b[j] ){
c[i][j]=c[i-1][j-1]+1;
v[p]=a[i];
p++;
}
else
c[i][j]=max(c[i][j-1],c[i-1][j]);
cout<<c[n][m]<<endl;
for(i=1;i<p;++i)
cout<<v[i]<<" ";
cout<<endl;
return 0;
}
