Cod sursa(job #2641750)

Utilizator Alex3973Silaghi Alex Alex3973 Data 12 august 2020 17:06:25
Problema Cel mai lung subsir comun Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.29 kb
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int A[256],B[256];
long n,m;
   int a[256][256];
    int b[256][256];
    int v[256],k;


void citire()
{
   ifstream in ("cmlsc.in");

    
    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)
{
    
 
    int v[256],k=0;

     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;
                        b[i][j] = 1;
                      

                            
                    }
                if(A[i]!=B[j])
                    {
                       if(a[i-1][j]>= a[i][j-1])
                            {
                                a[i][j] = a[i-1][j];
                                b[i][j] = 2 ;
                            }
                        else
                        {
                            a[i][j] = a[i][j-1];
                            b[i][j] = 3;
                        }
                        


                    }

                
            }
    

    
}
void solutie(int i, int j)
{ofstream out ("cmlsc.out");
    while(i!=0 or j!=0)
    {    
            if(b[i][j] == 1)
            {
               v[k] = A[i];
               i = i-1;
               j = j-1;
               k++;
               
                
            }
        else
        {
            if(b[i][j]==2)
                {
                    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 ("cmlsc.in");
 ofstream out ("cmlsc.out");
      in>>n;
    in>>m;


    citire();
    afisare(n,m);
return 0;

}