摘要： //最长公共子序列#include<iostream>#include<string>using namespace std;int Max(int i,int j){ return i>j?i:j;}int LCSlength(string s1,string s2){ int i,j; int len1=s1.size(); int len2=s2.size(); int **a=new int *[len1+1]; for(i=0;i<=len1;++i) a[i]=new int[len2+1]; for(i=0;i<=len1;i++)//注 阅读全文

摘要： Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35460Accepted Submission(s): 9511Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, a 阅读全文