Cod sursa(job #1963958)

Utilizator FlorinHajaFlorin Gabriel Haja FlorinHaja Data 12 aprilie 2017 22:34:27
Problema Cel mai lung subsir comun Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <fstream>
std::ifstream f("cmlsc.in");
std::ofstream g("cmlsc.out");
int n,m,i,j,a[1025],b[1025],dp[1025][1025],nr,sol[1025];
int main(){
    f>>n>>m;
    for(i=1;i<=n;f>>a[i++]);
    for(i=1;i<=m;f>>b[i++]);
    for(i=1;i<=n;i++)for(j=1;j<=m;j++)
        if (a[i]==b[j])dp[i][j]=dp[i-1][j-1]+1;
        else dp[i][j]=std::max(dp[i-1][j],dp[i][j-1]);
    for(i=n,j=m;i&&j;){
        while(dp[i-1][j]==dp[i][j])i--;
        while(dp[i][j-1]==dp[i][j])j--;
        nr++,sol[dp[i][j]]=a[i--],j--;
    }
    g<<nr<<'\n';
    for(i=1;i<=nr;g<<sol[i++]<<" ");
}