摘要：
UVA - 10405Longest Common SubsequenceTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionProblem C: Longest Common SubsequenceSequence 1:Sequence 2: Given two sequences of characters, print the length of the longest common subsequence of both seq 阅读全文
摘要：
此题比较简单!!不多说!! Gnome SequencingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1526Accepted: 1022DescriptionIn the book All Creatures of Mythology, gnomes are kind, bearded creatures, while goblins tend to be bossy and simple-minded. The goblins like to harass the gnomes by making them line 阅读全文
摘要：
//这题是很基础的题目！但上级比赛时忽略了一点，总是导致wrong，哎！遗憾！！#includeusing namespace std;#defineMAX 10000 int main(){int cy[MAX];int num1,num2; cy[0]=0; cy[1]=1;for(int i=2;i>num1>>num2){ int max=0; if(num1max) max=cy[i]; } } else{ for(int i=num2;imax) max=cy[i]; } } cout<<num1<<" "<< 阅读全文