1958 LCS3

#include <stdio.h>
#include <string>
#include <iostream>
#include <algorithm>
 
using namespace std;
 
string str1;
string str2;
string str3;
 
int dp[105][105][105] = { 0 };
 
int main() {
    cin >> str1 >> str2 >> str3;
 
    str1 = "0" + str1;
    str2 = "0" + str2;
    str3 = "0" + str3;
 
    int len1 = str1.length() - 1;
    int len2 = str2.length() - 1;
    int len3 = str3.length() - 1;
    
    for (int i = 1; i <= len1; i++) {
        for (int j = 1; j <= len2; j++) {
            for (int k = 1; k <= len3; k++) {
                if ((str1[i] == str2[j]) && (str2[j] == str3[k])) {
                    dp[i][j][k] = dp[i - 1][j - 1][k - 1] + 1;
                }
                else {
                    int val1 = max(dp[i - 1][j - 1][k], max(dp[i][j - 1][k - 1], dp[i - 1][j][k - 1]));
                    int val2 = max(dp[i - 1][j][k], max(dp[i][j - 1][k], dp[i][j][k - 1]));
                    
                    dp[i][j][k] = max(val1, val2);
                }
            }
        }
    }
 
    printf("%d", dp[len1][len2][len3]);
}