Cod sursa(job #3252033)

Utilizator Alexbora13Bora Ioan Alexandru Alexbora13 Data 28 octombrie 2024 11:23:16
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.92 kb
#include <bits/stdc++.h>
#include <regex>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
const int NMAX = 1024;

int n, m;
int a[NMAX+1];
int b[NMAX+1];
pair<int, string> dp[NMAX+1];
pair<int, string> dp2[NMAX+1];

int main() 
{
    fin >> n >> m;
    for(int i=1; i<=n; i++)
        fin >> a[i];
    for(int i=1; i<=m; i++)
        fin >> b[i];
    dp[1] = {1, to_string(a[1])+' '};
    dp2[1] = {1, to_string(b[1])+' '};
    for(int i=2; i<=n; i++) 
    {
        for(int j=1; j<i; j++) 
        {
            if(a[j] < a[i]) 
            {
                if(dp[j].first+1 > dp[i].first) {
                    dp[i].first = dp[j].first+1;
                    dp[i].second = dp[j].second+to_string(a[i])+' ';
                }
            }
        }
    }
    for(int i=2; i<=m; i++) 
    {
        for(int j=1; j<i; j++) 
        {
            if(b[j] < b[i]) 
            {
                if(dp2[j].first+1 > dp2[i].first) 
                {
                    dp2[i].first = dp2[j].first+1;
                    dp2[i].second = dp2[j].second+to_string(b[i])+' ';
                }
            }
        }
    }
    string maxi = " ";
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++) 
        {
            if(dp[i].second.size() > dp2[j].second.size())
            {
                regex r("(.*)"+dp2[j].second);
                if(regex_match(dp[i].second, r))
                {
                    if(dp2[j].second.size() > maxi.size())
                        maxi = dp2[j].second;
                }
            }
            else
            {
                regex r("(.*)"+dp[i].second);
                if(regex_match(dp2[j].second, r))
                {
                    if(dp[i].second.size() > maxi.size())
                        maxi = dp[i].second;
                }
            }
        }
    fout << maxi;
    return 0;
}