백준 소스코드 [C++] 1958 LCS 3

www.acmicpc.net/problem/1958

1958번: LCS 3

백준 소스코드 [C++] 1958 LCS 3

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
typedef long long ll;
using namespace std;
int arr[101][101][101];
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	string f, s, t;
	cin >> f;
	cin >> s;
	cin >> t;
	int a = s.size(), b = f.size(), c = t.size();
	memset(arr, 0, sizeof(arr));
	for (int i = 1;i <= a;i++)
		for (int j = 1;j <= b;j++)
			for (int k = 1;k <= c;k++)
				if (s[i - 1] == f[j - 1] && s[i - 1] == t[k - 1]) 
					arr[i][j][k] = arr[i - 1][j - 1][k-1] + 1;
				else arr[i][j][k] = max({ arr[i - 1][j][k], arr[i][j - 1][k],arr[i][j][k - 1] });
	cout << arr[a][b][c];
	return 0;
}