Submission

Score: 30

User: havename

Problemset: Dvaravati-LCS

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-05 13:43:54

#include<bits/stdc++.h>
using namespace std;

int main(){
    string n1,n2;
    vector<char> ans;

    cin>>n1>>n2;

    int n=n1.size();
    int m=n2.size();

    vector<vector<int>> dp(n+1,vector<int>(m+1,0));

    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(n1[i-1]==n2[j-1]){
                dp[i][j]=1+dp[i-1][j-1];
            }
            else{
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
        }
    }

    int i=n,j=m;

    while(i>0 && j>0){
        if(n1[i-1]==n2[j-1]){
            ans.push_back(n1[i-1]);
            i--;
            j--;
        }
        else if(dp[i-1][j]>=dp[i][j-1]){
            i--;
        }
        else{
            j--;
        }
    }

    reverse(ans.begin(),ans.end());

    for(char c:ans) cout<<c;

    cout<<"\n"<<dp[n][m]<<"\n";

    if(dp[n][m] >= n/2){
        cout<<"y";
    }
    else{
        cout<<"n";
    }
}