Cod sursa(job #1646795)

Utilizator ionuttiplea2001Tiplea Ionut ionuttiplea2001 Data 10 martie 2016 17:46:51
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in") ;
ofstream g("cmlsc.out") ;
int n , m  , i , j  , h = 0 ;
int main()
{
    f >> n >> m ;
    int a[n+1] , b[m+1] , k = 0 ;
    for ( i = 1 ; i <= n ; i ++ )
    {
        f >> a[i];
    }
    for ( j = 1 ; j <= m ; j ++ )
        f >> b[j] ;
    for ( i = 1 ; i <= n ; i ++ )
    {
        for ( j = 1 ; j <= m ; j ++ )
            if ( a[i] == b[j] and j > k )
        {
            k = j ;
            g << a[i] << " " ;
            h ++ ;
        }
    }
    return 0;
}