Mai intai trebuie sa te autentifici.
Cod sursa(job #383940)
Utilizator | Data | 18 ianuarie 2010 20:02:46 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include<stdio.h>
FILE *f=fopen("cmlsc.in","r"), *g=fopen("cmlsc.out","w");
int v1[1025],v2[1025],max,n1,n2,c[1025][1025];
void rezolvare()
{int i,j;
for(i=1;i<=n1;i++)
for(j=1;j<=n2;j++)
{
if(v1[i]==v2[j])
c[i][j]=1+c[i-1][j-1];
else
{
if(c[i][j-1]>c[i-1][j])
c[i][j]=c[i][j-1];
else
c[i][j]=c[i-1][j];
}
if(c[i][j]>max)
max=c[i][j];
}
}
int main()
{
fscanf(f,"%d %d", &n1,&n2);
int i,j;
for(i=1;i<=n1;i++)
fscanf(f,"%d",&v1[i]);
for(i=1;i<=n2;i++)
fscanf(f,"%d", &v2[i]);
rezolvare();
fprintf(g,"%d",max);
fclose(f);
fclose(g);
return 0;
}