Pagini recente » Cod sursa (job #250368) | Cod sursa (job #730297) | Cod sursa (job #556394) | Cod sursa (job #2370491) | Cod sursa (job #260855)
Cod sursa(job #260855)
#include<fstream>
#include<iostream>
using namespace std;
int max(int a, int b)
{
if(a>b) return a;
else return b;
}
int m,n,i,j,a[1024],b[1024],c[1024][1024], s[1024],k=0;
int main()
{
ifstream f("cmlsc.in");
f>>m>>n;
for(i=1;i<=m;i++)
f>>a[i];
for(j=1;j<=n;j++)
f>>b[j];
f.close();
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
{
c[i][j]=c[i-1][j-1]+1; s[++k]=a[i];}
else c[i][j]=max(c[i-1][j], c[i][j-1]);
ofstream g("cmlsc.out");
g<<c[m][n]<<endl;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
g<<a[i]<<" ";
g<<s[i]<<" ";
g.close();
return 0;
}