1159_Batman.md

Algorithm: DP

Problem: 1159 Batman

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vb vector<bool>
#define vs vector<string>
///............x...........///
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ff first
#define ss second
#define bg begin()
#define UNIQUE(X) (X).erase(unique(all(X)), (X).end())
#define ft cout << "for test"<<endl;
#define read(v, a, n) for (int i = a; i<n; i++)cin>>v[i];
#define print(v) for (auto it : v)cout << it<<' ';cout << endl;
#define PI acos(-1.0)
#define yes cout <<"Yes"<< endl
#define no cout<<"No"<<endl
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define t_c int test, cs = 1;cin>>test;while (test--)
#define casep cout<<"Case "<< cs++<<": ";
///................function.....................///

#define D(a) (double)(a)
#define sqr(a) (a * a)
#define siz(s) (int)(s.size())
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define Min(a) *min_element(all(a))
///#define mod 1000000007
///.........Graph.........///
int X[] = {1, -1, 0, 0};
int Y[] = {0, 0, 1, -1};
///........constant........///
const ll N = 1e6+5;
int main(){
    FIO;
    t_c{
        string s[3];
        cin>>s[0]>>s[1]>>s[2];
        int n[3]={siz(s[0]),siz(s[1]),siz(s[2])},i,j,k;
        int lcs[n[0]+1][n[1]+1][n[2]+1],ans=0;
        for(i=0; i<n[0]+1; i++){
            for(j=0; j<n[1]+1; j++){
                for(k=0; k<n[2]+1; k++){
                    if(i==0 or j==0 or k==0){
                        lcs[i][j][k] = 0;
                    }
                    else if(s[0][i-1]==s[1][j-1] and s[0][i-1]==s[2][k-1]){
                        lcs[i][j][k] = lcs[i-1][j-1][k-1]+1;
                    }
                    else lcs[i][j][k] = max({lcs[i-1][j][k],lcs[i][j-1][k],lcs[i][j][k-1]});
                    ans = max(ans,lcs[i][j][k]);
                }
            }
        }
        casep;
        cout<<ans<<endl;
    }
}