String Game Gym - 102800C（动态规划）

#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
char a[5005], b[1005];
int dp[1005][5005];   //第一位存已经匹配到的数位，第二位存当前进行到的数位
int n, m, i, j;
int main() 
{
    scanf("%s%s", a + 1, b + 1);
    memset(dp, 0, sizeof(dp));
    n = strlen(a + 1);
    m = strlen(b + 1);
    for (i = 1; i <= m; i++) 
    {
        for (j = 1; j <= n; j++) 
        {
            if (a[j] == b[i]) 
            {
                if (i == 1)
                    dp[i][j] = (1 + dp[i][j - 1]) % M;
                else
                    dp[i][j] = (dp[i - 1][j - 1] + dp[i][j - 1]) % M;
            } 
            else 
            {
                dp[i][j] = dp[i][j - 1];
            }
        }
    }
    printf("%d\n", dp[m][n]);
}