Longest Common Subsequence

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main(){
    char a[]="abcb";
    char b[]="bdcab";
    int sa=strlen(a);
    int sb=strlen(b);
    int m[sa+2][sb+2],i,j;
    memset(m,0,sizeof (m));
    for (i=1; i<=sa; i++){
        for (j=1; j<=sb; j++){
            if (a[i-1]==b[j-1])
                m[i][j]=m[i-1][j-1]+1;
            else
                m[i][j]=max(m[i-1][j],m[i][j-1]);
        }
    }
    for (i=0; i<=sa; i++){
        for (j=0; j<=sb; j++)
            printf("%d ",m[i][j]);
        printf("\n");
    }
    printf("%d\n",m[i-1][j-1]);
}