Cacher is the code snippet organizer for pro developers

int n,m;
char s[MAX_N], t[MAX_M];
int dp[MAX_N+1][MAX_M+1];

void solve(){
        for (int i=0; i<n; i++){
                for(int j=0; j<m; j++){
                        if(s[i]==t[i])
                                dp[i+1][j+1]=dp[i][j]+1;
                        else
                                dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);
                }
        }
        cout << dp[n][m];
}