两个字符串中最长公共子序列

    string s1="svow1213";
    string s2="sds121921";
    int dp[s1.length()+1][s2.length()+1];
    for(int i=0;i<s1.length()+1;i++){
        dp[i][0] = 0;
    }
    for(int i=0;i<s2.length()+1;i++){
        dp[0][i] = 0;
    }
    for(int i=1;i<s1.length()+1;i++){
        for(int j=1;j<s2.length()+1;j++){
            if(s1[i-1]==s2[j-1]){
                dp[i][j]=dp[i-1][j-1]+1;
            }else{
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
        }
    }
    int max=0;
    for(int i=0;i<s1.length()+1;i++){
        for(int j=0;j<s2.length()+1;j++){
            if(max<dp[i][j]){
                max = dp[i][j];
            }
        }
    }
    cout<<max;