最長公共子序列

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    static int LCS(String a,String b){
        int sa=a.length();
        int sb=b.length();
        int[][] c=new int[sa+1][sb+1];//c[sa][sb]表示LCS長度
        for(int i=0;i<sa+1;i++)c[i][0]=0;
        for(int i=0;i<sb+1;i++)c[0][i]=0;
        for(int i=1;i<sa+1;i++){
            for(int j=1;j<sb+1;j++){
                if(a.charAt(i-1)==b.charAt(j-1))
                    c[i][j]=c[i-1][j-1]+1;
                else
                    c[i][j]=Math.max(c[i-1][j],c[i][j-1]);
            }
        }
        return c[sa][sb];
        
    }

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner cin=new Scanner(System.in);
        String a=cin.next();
        String b=cin.next();
        System.out.println(LCS(a,b));
        
    }
}