摘要：
Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more diffic... 阅读全文
摘要：
Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical str... 阅读全文
摘要：
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7)... 阅读全文
摘要：
Little girl Susie went shopping with her mom and she wondered how to improve service quality.There arenpeople in the queue. For each person we know ti... 阅读全文
摘要：
Little Susie loves strings. Today she calculates distances between them. As Susie is a small girl after all, her strings contain only digits zero and ... 阅读全文
摘要：
Little Susie, thanks to her older brother, likes to play with cars. Today she decided to set up a tournament between them. The process of a tournament... 阅读全文
摘要：
Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters and the little girl immediately started imagining ... 阅读全文
摘要：
Problem DescriptionSVM（Support Vector Machine）is an important classification tool, which has a wide range of applications in cluster analysis, communi... 阅读全文
摘要：
Description把前n个正整数摆成1个环，如果环中所有相邻的2个数之和都是1个素数，该环称为1个n项素数和环。 输入1个整数n,输出共有多少种Input输入一个正整数nOutput输出环的个数，要求环的第一个数字是1Sample Input4Sample Output2HINT大意：回溯，要会... 阅读全文
摘要：
Problem DescriptionTom and Jerry are playing a game with tubes and pearls. The rule of the game is:1) Tom and Jerry come up together with a number K.2... 阅读全文