Submission

Score: 100

User: navysrimuang

Problemset: Dvaravati-LCS

Language: cpp

Time: 0.006 second

Submitted On: 2026-03-16 10:37:06

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

int main(){
	cin.tie(0)->sync_with_stdio(0);
	string a,b;
	cin >> a >> b;
	int n = a.size();
	string s;
	vector<vector<int>> dp(n+1,vector<int>(n+1,0));
	for(int i = 1;i<=n;i++){
		int cnt = 0;
		for(int j = 1;j<=n;j++){
			dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
			if(a[i-1] == b[j-1]) dp[i][j] = max(dp[i][j], dp[i-1][j-1]+1);
		}
	}
	int i = n, j = n;
	while(i > 0 && j > 0){
		if(a[i-1] == b[j-1]){
			s += a[i-1];
			i--;
			j--;
		}else if(dp[i-1][j] > dp[i][j-1]){
			i--;	
		}else{
			j--;
		}

	}
	reverse(s.begin(),s.end());
	
	cout << s << "\n" << dp[n][n] << "\n" << (dp[n][n] > n/2 ? 'y' : 'n') << "\n";
	return 0;
}