Cod sursa(job #2828531)

Utilizator bagae123Burlacu Andrei bagae123 Data 7 ianuarie 2022 15:42:45
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.84 kb
#include <fstream>

using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1025],v[1025],b[1025],c[1025][1025],st[1025];
int main()
{
   int n,m,i,j,mx,k=0;
   fin>>n>>m;
   for(i=1;i<=n;i++)
   {
    fin>>v[i];
   }
   for(j=1;j<=n;j++)
   {
       fin>>b[j];
   }for(i=1;i<=n;i++)
{
    for(j=1;j<=m;j++)
    {
        if(v[i]==b[j])c[i][j]=1+c[i-1][j-1];
        else c[i][j]=max(c[i-1][j],c[i][j-1]);
    }
}
mx=c[n][m];
fout<<mx<<"\n";
 mx=c[n][m];
    i=n;
    j=m;
    fout<<mx<<"\n";
    while(mx)
    {
        if(v[i]==b[j])
        {
            k++;
            st[k]=v[i];
            mx--;
            i--;
            j--;
        }
        else if(mx==c[i-1][j]) i--;
        else j--;
    }
    for(i=k;i>=1;i--)
    {
        fout<<st[i]<<" ";
    }

    return 0;
}