POJ 1458 Common Subsequence(LCS 最长公共子序列)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#define ll long long

using namespace std;
string s1,s2;
int dp[1005][1005];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    while(cin >> s1 >> s2)
    {
        memset(dp,0,sizeof(dp));
        int n1=s1.size(),n2=s2.size();
        for(int i=1;i<=n1;i++)
        {
            for(int j=1;j<=n2;j++)
            {
                if(s1[i-1]==s2[j-1])
                {
                    dp[i][j]=dp[i-1][j-1]+1;
                }
                else
                {
                    dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
                }
            }
        }
        cout << dp[n1][n2] << endl;
    }
    return 0;
}