Cod sursa(job #3330308)
| Utilizator | Data | 18 decembrie 2025 17:40:18 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.99 kb |
#include <iostream>
using namespace std;
int main()
{
int m, n, i, j, k, x;
int a[1024], b[1024], c[1024][1024], sir[1024];
x=0; c[1024][1024]={0};
cin >> m >> n;
for (i=1; i<=m; i++)
cin >> a[i];
for (i=1; i<=n; i++)
cin >> a[i];
for (i=1; i<=m; i++)
for (j=1; j<=n; j++)
{
if (a[i]==a[j])
c[i][j]=c[i-1][j-1]+1;
else
{
if (c[i-1][j]>c[i][j-1])
c[i][j]=c[i-1][j];
else
c[i][j]=c[i][j-1];
}
}
i=m; j=n;
while (i>0 && j>0)
{
if (a[i]==b[j])
{
sir[x++]=a[i];
i--;
j--;
}
else
{
if (c[i- 1][j]<c[i][j - 1])
j--;
else
i--;
}
}
cout << x << endl;
for (k=x; k>=1; k--)
cout << sir[k] << " ";
}
