Cod sursa(job #263123)

Utilizator iuliaelenabulz iulia elena iuliaelena Data 19 februarie 2009 22:18:56
Problema Cel mai lung subsir comun Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#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;

}