Cod sursa(job #1131209)

Utilizator BossForYOUHale Georgian-Dorin BossForYOU Data 28 februarie 2014 18:30:38
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <iostream>
#include <fstream>

using namespace std;

int M,N;

int m(int a,int b)
{
    if (a>=b) return a;
    return b;
}

int main()
{
    int v1[M],v2[N],v3[m(M,N)],k=0,i,j,p=0;
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    f>>M>>N;
    for (i=0;i<M;i++)
    {
        f>>v1[i];
    }
    for (j=0;j<N;j++)
    {
        f>>v2[j];
    }
    for (i=0;i<M;i++)
    {
        for (j=0;j<N;j++)
        {
            if (v1[i]==v2[j])
            {
                if (p==0)
                {
                    v3[p]=v1[i];
                    p++;
                    k++;
                }
                else if (v1[i]>v3[p-1])
                {
                    v3[p]=v1[i];
                    p++;
                    k++;
                }
            }
        }
    }
    g<<k<<"\n";
    for (p=0;p<k;p++)
    {
        g<<v3[p]<<" ";
    }
    f.close(),g.close();
    return 0;
}