Cod sursa(job #1367354)
| Utilizator | Data | 1 martie 2015 20:08:40 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include<fstream>
using namespace std;
long n,m,i,j,v[1025],d,ma,aux,a[1025],b[1025],k;
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
f>>b[i];
for(i=1;i<=m;i++)
{d=0;
for(j=1;j<=n;j++)
{
if(v[j]>d)
d=v[j];
if(a[j]==b[i])
{
v[j]=d+1;
if(d+1>ma) ma=d+1;
}
if(d>ma)
ma=d;
}
}
g<<ma<<'\n';
k=1;
for(i=1;i<=n && k<=ma;i++)
if(v[i]==k)
{
g<<a[i]<<" ";
k++;;
}
return 0;
}
