Nu aveti permisiuni pentru a descarca fisierul grader_test2.ok
Cod sursa(job #488501)
| Utilizator | Data | 28 septembrie 2010 22:53:06 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.92 kb |
#include <fstream>
using namespace std;
#include <string.h>
int v[201][201],sir[201],a[201],b[201];
int n,m,bst;
void matrice()
{
int i,j;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
if(a[i]==b[j])
v[i][j]=v[i-1][j-1]+1;
else if(v[i-1][j]>v[i][j-1]) v[i][j]=v[i-1][j];
else v[i][j]=v[i][j-1];
}
}
void citire()
{
int i,j;
for (i = m, j = n; i;)
if (a[i] == b[j])
sir[++bst] = a[i], --i, --j;
else if (v[i-1][j] < v[i][j-1])
--j;
else
--i;
}
void scriere()
{
int i;
ifstream in("cmlsc.in");
in>>m>>n;
for(i=1;i<=m;i++)
in>>a[i];
for(i=1;i<=n;i++)
in>>b[i];
in.close();
}
int main()
{
int i;
ofstream out("cmlsc.out");
scriere();
matrice();
citire();
for(i=1;i<=bst;i++)
{
out<<sir[i];
}
out.close();
return 0;
}
