Cod sursa(job #1326851)

Utilizator kira2071Diana C kira2071 Data 26 ianuarie 2015 07:38:28
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;

//1024
int a[1200][1200],n,m,v1[1200],v2[1200];
int b[1200],q;

int main()
{int i,j;
ifstream f("cmlsc.in");
FILE *g=fopen("cmlsc.out","w");

f>>n>>m;
for(i=1;i<=n; i++)
    f>>v1[i];
for(i=1;i<=m; i++)
    f>>v2[i];

for(i=1;i<=n; i++)
    for(j=1;j<=m; j++)
        {if(v1[i]==v2[j])
            {a[i][j]=a[i-1][j-1]+1;
            b[++q]=v1[i];
            }
        /*else
            if(a[i][j-1]>a[i-1][j])
                a[i][j]=a[i][j-1];
            else
                a[i][j]=a[i-1][j];*/
        }
/*for(i=0;i<=n; i++)
    {for(j=0;j<=m; j++)
        cout<<a[i][j]<<" ";
    cout<<endl;
    }*/

fprintf(g,"%d\n",q);
for(i=1;i<=q; i++)
    fprintf(g,"%d ",b[i]);




return 0;
}