1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <iostream>
#include <vector>
#include <string>

using namespace std;

// https://www.geeksforgeeks.org/cpp-program-for-longest-common-subsequence/

int lcs(string X, string Y, int m, int n)
{
    vector<vector<int>> L(m + 1, vector<int>(n + 1));
    int i, j;

    for (i = 0; i <= m; i++) {
        for (j = 0; j <= n; j++) {
            if (i == 0 || j == 0)
                L[i][j] = 0;

            else if (X[i - 1] == Y[j - 1])
                L[i][j] = L[i - 1][j - 1] + 1;

            else
                L[i][j] = max(L[i - 1][j], L[i][j - 1]);
        }
    }

    return L[m][n];
}

int main()
{
    ios::sync_with_stdio(false);
    int n, m, q;

    cin >> n >> m >> q;

    string a, b;

    cin >> a >> b;

    int ai, aj, bi, bj, a_len, b_len;

    for (int i = 0; i < q; i++)
    {
        cin >> ai >> aj >> bi >> bj;

        a_len = aj - ai + 1;
        b_len = bj - bi + 1;

        cout << lcs(a.substr(ai - 1, a_len), b.substr(bi - 1, b_len), a_len, b_len) << endl;
    }
}