#include <bits/stdc++.h> using namespace std; #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define ll long long ll mod=1000000007; int inf=1000000007; ll infl=1000000000000000007; int DP[607][607]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,m,q; cin>>n>>m>>q; string a,b; cin>>a>>b; a='#'+a; b='#'+b; while(q--) { int i,j,l,k; cin>>i>>j>>l>>k; for(;i<=j;i++) { for(int L=l;L<=k;L++) { DP[i][L]=max(DP[i-1][L],DP[i][L-1]); if(a[i]==b[L]) DP[i][L]=max(DP[i][L],DP[i-1][L-1]+1); } } cout<<DP[j][k]<<endl; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { DP[i][j]=0; } } } return 0; }
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 | #include <bits/stdc++.h> using namespace std; #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define ll long long ll mod=1000000007; int inf=1000000007; ll infl=1000000000000000007; int DP[607][607]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,m,q; cin>>n>>m>>q; string a,b; cin>>a>>b; a='#'+a; b='#'+b; while(q--) { int i,j,l,k; cin>>i>>j>>l>>k; for(;i<=j;i++) { for(int L=l;L<=k;L++) { DP[i][L]=max(DP[i-1][L],DP[i][L-1]); if(a[i]==b[L]) DP[i][L]=max(DP[i][L],DP[i-1][L-1]+1); } } cout<<DP[j][k]<<endl; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { DP[i][j]=0; } } } return 0; } |