Pagini recente » Cod sursa (job #442629) | Cod sursa (job #12385) | Cod sursa (job #1630233) | Cod sursa (job #722036) | Cod sursa (job #711149)
Cod sursa(job #711149)
#include<fstream>
using namespace std;
ofstream out("cmlsc.out");
ifstream in("cmlsc.in");
int x[1029],y[1029],n,m;
int lcs[1029][1029];
void rezolva(){
for(int k=1;k<=n;k++)
for(int h=1;h<=m;h++)
if(x[k]==y[h]) lcs[k][h]=1+lcs[k-1][h-1];
else
if (lcs[k-1][h]>lcs[k][h-1]) lcs[k][h]=lcs[k-1][h];
else lcs[k][h]=lcs[k][h-1];
}
void afiseaza_solutie_max(int k,int h){
if(lcs[k][h])
if(x[k]==y[h])
{afiseaza_solutie_max(k-1,h-1);
out<<x[k]<<' ';}
else
{if (lcs[k][h]==lcs[k-1][h])
afiseaza_solutie_max(k-1,h);
else if (lcs[k][h]==lcs[k][h-1])
afiseaza_solutie_max(k,h-1);
}
}
int main(){
int i,j,maxx=0;
in>>n>>m;
for(i=1;i<=n;i++) in>>x[i];
for(i=1;i<=m;i++) in>>y[i];
rezolva();
out<<lcs[n][m]<<"\n";
afiseaza_solutie_max(n,m);
return 0;
}