Cod sursa(job #1570167)

Utilizator AndreiD31Dragan Andrei AndreiD31 Data 16 ianuarie 2016 11:20:26
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>

using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int x[1025],y[1025],c[1025][1025],n,m;
void solve ()
{
    int i,j;
    for(i=1; i<=n; i++)
        for(j=1; j<=m; j++)
            if(x[i]==y[j])c[i][j]=c[i-1][j-1]+1;
            else c[i][j]=max(c[i-1][j],c[i][j-1]);
            g<<c[n][m]<<'\n';

}

void afis (int i,int j)
{
    if(i>=1&&j>=1)
        if(x[i]!=y[j])
            if(c[i][j-1]>c[i-1][j])afis (i,j-1);
            else afis (i-1,j);
        else
        {
            afis(i-1,j-1);
            g<<x[i]<<" ";
        }


}
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)f>>x[i];
    for(int i=1; i<=m; i++)f>>y[i];

    solve();
    afis(n,m);

    return 0;
}