Cod sursa(job #3171868)
Utilizator | torcea rares [email protected] | Data | 19 noiembrie 2023 17:57:51 |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.91 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int v1[1025];
int v2[1025];
int dp[1025][1025];
int sir[1025];
int main()
{
int n,m;
f>>n>>m;
int i,j;
for(i=1;i<=n;i++)
f>>v1[i];
for(i=1;i<=n;i++)
f>>v2[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(v1[i]!=v2[j])
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
else
dp[i][j]=dp[i-1][j-1]+1;
}
}
int cnt=0;
i=n;
j=m;
while(i && j)
{
if(v1[i]==v2[j])
{
sir[++cnt]=v1[i];
i--;
j--;
}
else
if(dp[i-1][j]<dp[i][j-1])
j--;
else
i--;
}
g<<cnt<<endl;
for(i=cnt;i>=1;i--)
g<<sir[i]<<" ";
return 0;
}