Cod sursa(job #2026347)

Utilizator vladavladaa vlada Data 24 septembrie 2017 12:46:59
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.35 kb
Raporteaza aceasta sursa 
#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int main()
{
    int n,m,i,j;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        if(a[i]==b[j])
          x[i][j]=x[i-1][j-1]+1;
        else
            x[i][j]=max(x[i-1][j],x[i][j-1]);
    fout<<
    return 0;
}