Cod sursa(job #667323)

Utilizator bia.liliPoenar Liana bia.lili Data 22 ianuarie 2012 21:15:02
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <fstream>
#define maxn 1030
using namespace std;
ifstream f("secvmin.in");
ofstream g("secvmin.out");
int m,n,a[maxn],b[maxn],d[maxn][maxn],s[maxn];
int main()
{
    int k=0,i=0,j=0;
    f>>m>>n;
    for(i=1;i<=m;i++)
    f>>a[i];
    for(i=1;i<=n;i++)
    f>>b[j];
    for(i=1;i<=m;i++)
    for(j=1;j<=n;j++)
    if(a[i]==b[j])
    d[i][j]=d[i-1][j-1]+1;
    else 
    if (d[i-1][j] > d[i][j-1])
    d[i][j]=d[i-1][j];
    else d[i][j]=d[i][j-1];
    g<<d[i][j];
    return 0;}