Cod sursa(job #789820)

Utilizator bia.liliPoenar Liana bia.lili Data 19 septembrie 2012 15:47:45
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include<fstream>
#define NMax 1024
using namespace std;
int m,n, A[NMax], B[NMax], D[NMax][NMax], sir[NMax], bst;
int main()
{
    
    int i,j;
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    f>>m>>n;
    for(i=1;i<=n;i++)
    f>>A[i];
    for(j=1;j<=m;j++)
    f>>B[j];
    for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
if (A[i] == B[j])
D[i][j]=1+D[i-1][j-1];
else if(D[i-1][j]<D[i][j-1])
D[i][j]=D[i][j-1];
else D[i][j]=D[i-1][j];

for(i = n, j = m; i;)
if(A[i]==B[j])
{bst++;
sir[bst]=A[i], i--,j--;}

else  if(D[i-1][j]<D[i][j-1])   
j--;

else

i--;
g<<bst<<"\n";

for (i = bst; i>=1; i--)

g<<sir[i]<<" ";
return 0;

}