摘要： Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 25178Accepted: 9726DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > 阅读全文

摘要： Help JimmyTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 6593Accepted: 2066Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。 Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者选择让它向左还是向右跑，它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时，开始继续下落。Jimmy每次下落的高度不能超过MAX 阅读全文

摘要： TripleTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 387Accepted Submission(s): 153Problem DescriptionGiven many different integers, find out the number of triples (a, b, c) which satisfy a, b, c are co-primed each other or are not co-primed each 阅读全文

摘要： SwordsmanTime Limit: 10000/4000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 308Accepted Submission(s): 116Problem DescriptionMr. AC is a swordsman. His dream is to be the best swordsman in the world. To achieve his goal, he practices every day. There are many ways 阅读全文

摘要： Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 19643Accepted: 8501DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 < 阅读全文