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
53
54
55
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>

using namespace std;

void solve(string x,string y)
{
    int n = x.size();
    int m = y.size();

    vector<vector<int > > dp;
    dp.resize(n + 5);
    for(int i=0;i<=n;i++) dp[i].resize(m + 5,0);

    for(int i=n;i>=0;i--)
    {
        for(int j=m;j>=0;j--)
        {
            if(i >= n || j >= m) continue;
            dp[i][j] = max(dp[i+1][j],dp[i][j+1]);
            if(x[i] == y[j]) dp[i][j] = max(dp[i][j], dp[i+1][j+1] + 1);
        }
    }

    cout<<dp[0][0]<<"\n";
    return;
}


int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    int n,m,q; cin>>n>>m>>q;
    string a,b; cin>>a>>b;
    while(q--)
    {
        int lo1,hi1,lo2,hi2; cin>>lo1>>hi1>>lo2>>hi2;

        string x = "";
        string y = "";
        for(int i=lo1;i<=hi1;i++) x += a[i - 1];
        for(int i=lo2;i<=hi2;i++) y += b[i - 1];
        solve(x,y);
    }


    return 0;
}