Submission

Score: 100

User: havename

Problemset: Dvaravati-LCS

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-05 13:56:03

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

int main(){
    string n1,n2;
    cin>>n1>>n2;

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

    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]=dp[i-1][j-1]+1;
            }
            else{
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
        }
    }

    int i=n,j=m;
    string ans1="";
    while(i>0 && j>0){
        if(n1[i-1]==n2[j-1]){
            ans1+=n1[i-1];
            i--;
            j--;
        }
        else if(dp[i][j-1]>=dp[i-1][j]){
            j--;
        }
        else{
            i--;
        }
    }

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

    cout<<ans1;

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

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