Cod sursa(job #2778759)
| Utilizator | Data | 2 octombrie 2021 10:02:00 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream o("cmlsc.out");
int main()
{
int i,j,m,n,a[1024],b[1024],ab[1024][1024];
f>>m>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
ab[i][j]=0;
for(i=1;i<=m;i++)
f>>a[i];
for(i=1;i<=n;i++)
f>>b[i];
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
ab[i][j]=1+ab[i-1][j-1];\
else
ab[i][j]=max(ab[i-1][j],ab[i][j-1]);
o<<ab[m][n]<<'\n';
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
o<<a[i]<<" ";
}
