NYOJ 最长公共子序列

# include<iostream>
# include<string>
# include<stdio.h>
using namespace std;
int d[][];
int main()
{
      int n,m;
      cin>>n;
      while(n--)
      {
          string s1,s2;
        cin>>s1>>s2;
        int len1 = s1.length(),len2 = s2.length();
        int i,j;
        for(i=;i<len1;i++)
        {
            for(j=;j<len2;j++)
            {
                if(s1[i]==s2[j])
                {
                    if(i==||j==)    d[i][j]= ;
                    else            d[i][j] = d[i-][j-] + ;
                }
                else
                {
                    if(i==&&j==)
                    {
                        d[i][j]= ;
                        continue;
                    }
                    if(i==)
                    {
                        d[i][j]= d[i][j-];
                        continue;
                    }
                    if(j==)
                    {
                        d[i][j]= d[i-][j];
                        continue;
                    }
                    if(d[i-][j]>=d[i][j-])    d[i][j] = d[i-][j];
                    else                        d[i][j] = d[i][j-];
                }
            }
        }
        cout<<d[len1-][len2-]<<endl;
    }
    return ;
}