hyx

摘要： RoadblocksTime Limit:2000MSMemory Limit:65536KTotal Submissions:6605Accepted:2458DescriptionBessie has moved to a small farm and sometimes enjoys retu... 阅读全文

摘要： D. Antimattertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub accidentally discovered a secr... 阅读全文

摘要： Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5616Accepted Submissi... 阅读全文

摘要： Sliding WindowTime Limit:12000MSMemory Limit:65536KTotal Submissions:35941Accepted:10636Case Time Limit:5000MSDescriptionAn array of sizen≤ 106is give... 阅读全文

摘要： D. Long Pathtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day, little Vasya found himself in a maze consisting of(n + 1)rooms, numbered from1to(n + 1). Initially, Vasya is at the first room and to get out of the maze, he needs to get to the( 阅读全文

摘要： 食物链Time Limit:1000MSMemory Limit:10000KTotal Submissions:40733Accepted:11850Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述：第一种说法是"1 X Y"，表示X和Y是同类。第二种说法是"2 X Y"，表示X吃Y。此人对N个动物，用上述两种说法，一句接一句地说出K句话，这K 阅读全文

摘要： Linear worldTime Limit:3000MSMemory Limit:65536KTotal Submissions:2448Accepted:564DescriptionThe Disc, being flat, has no real horizon. Any adventurous sailors who get funny ideas from staring at eggs and oranges for too long and set out for the antipodes soon learned that the reason why distant shi 阅读全文

摘要： EXTENDED LIGHTS OUTTime Limit:1000MSMemory Limit:10000KTotal Submissions:6196Accepted:4074DescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light. When a button is pressed, that butt 阅读全文

摘要： SubsetTime Limit:30000MSMemory Limit:65536KTotal Submissions:1373Accepted:228DescriptionGiven a list of N integers with absolute values no larger than 1015, find a non empty subset of these numbers which minimizes the absolute value of the sum of its elements. In case there are multiple subsets, cho 阅读全文

摘要： SumsetsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8235Accepted:2260DescriptionGiven S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S.InputSeveral S, each consisting of a line containing an integer 1 2 #include 3 #include 4... 阅读全文