二维树状数组 解北大2155 http://acm.pku.edu.cn/JudgeOnline/problem?id=21-Solution of two-dimensional array tree Beijing 2155http:// acm.pku.edu.cn/JudgeOnline/problem? Id = 21

最长公共上升子序列的O(n^2)算法,pku 2127-O(n^2) algorithm of the greastest increasing common subsequence, pku 2127