Cod sursa(job #2641782)
Utilizator | Data | 12 august 2020 18:02:09 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 2.19 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int A[1024],B[1024];
int n,m;
int a[1024][1024];
void citire()
{
ifstream in ("cmls.in.txt");
in>>n;
in>>m;
for(int i = 1; i<=n; i++)
in>>A[i];
for(int i = 1; i<=m; i++)
in>>B[i];
}
void lungime(int n, int m)
{
for(int i = 1; i<=n; i++)
{
a[i][0] = 0;
}
for(int i = 1; i<=m; i++)
{
a[0][i] = 0;
}
for(int i = 1; i<=n; i++)
for(int j = 1; j<=m; j++)
{
if(A[i]==B[j])
{
a[i][j] = a[i-1][j-1]+1;
}
if(A[i]!=B[j])
{
if(a[i-1][j]>= a[i][j-1])
{
a[i][j] = a[i-1][j];
}
else
{
a[i][j] = a[i][j-1];
}
}
}
}
void solutie(int i, int j)
{
ofstream out ("cmls.out.txt");
int v[1024],k;
while(i!=0 and j!=0)
{
if(A[i] == B[j])
{
v[k] = A[i];
i = i-1;
j = j-1;
k++;
}
else
{
if(a[i-1][j]>= a[i][j-1])
{
i--;
}
else
{
j--;
}
}
}
out<<k<<endl;;
for(int i = k-1; i>=0;i--)
out<<v[i]<<" ";
}
void afisare(int n, int m)
{
lungime(n,m);
solutie(n,m);
}
int main()
{
ifstream in ("cmls.in.txt");
ofstream out ("cmls.out.txt");
in>>n;
in>>m;
citire();
afisare(n,m);
return 0;
}