nyoj36(模板)

#include <iostream>#include<string>#include<string.h>#include<stdio.h>#include<algorithm>#include<vector>#include<cmath>using namespace std;char m1[1000],m2[1000];int dp[1000][1000];int main(){    int t;    cin>>t;    while(t--)    {        memset(dp,0,sizeof(dp));        cin>>m1>>m2;        int lena=strlen(m1);        int lenb=strlen(m2);        for(int i=1;i<=lena;i++)            for(int j=1;j<=lenb;j++)        {            if(m1[i-1]==m2[j-1])                dp[i][j]=dp[i-1][j-1]+1;            else                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);        }        cout<<dp[lena][lenb]<<endl;    }}