leetcode-Distinct Subsequences

Given a string S and a string T, count the number of distinct subsequences of T in S.

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ACE" is a subsequence of "ABCDE" while "AEC" is not).

Here is an example:
S = "rabbbit", T = "rabbit"

Return 3.

class Solution {
public:
    int numDistinct(string S, string T) {
        int n = S.length();
        int m = T.length();
        if(n < m)return 0;
        if(m == 0)return 1;
        if(n == 0)return 0;
        int val = 0;
        int dp[11000][50];
        for(int i = 0; i < n; i++)
        {
            if(S[i] == T[0])val++;
            dp[i][0] = val;
        }
        
        for(int j = 1; j < m; j++)dp[0][j] = 0;
        
        for(int j = 1; j < m; j++)
            for(int i = 1; i < n; i++)
            {
                if(S[i] == T[j])
                {
                    dp[i][j] = dp[i-1][j]+dp[i-1][j-1];
                }
                else
                {
                    dp[i][j] = dp[i-1][j];
                }
            }
        
        return dp[n-1][m-1];
    }
};