算法爱好者

摘要： A Short problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 779Accepted Submission(s): 296Problem Description According to a research, VIM users tend to have shorter fingers, compared with Emacs users. Hence they prefer problems short, too. He.. 阅读全文

摘要： CoderTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1260Accepted Submission(s): 551Problem Description In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become.. 阅读全文

摘要： Balanced LineupTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 24349Accepted: 11348Case Time Limit: 2000MSDescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with som 阅读全文

摘要： 连连看Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10237Accepted Submission(s): 2695Problem Description“连 连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来 （这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学 阅读全文

摘要： Sticks ProblemTime Limit: 6000MSMemory Limit: 65536KTotal Submissions: 8623Accepted: 2222DescriptionXuanxuan has n sticks of different length. One day, she puts all her sticks in a line, represented by S1, S2, S3, ...Sn. After measuring the length of each stick Sk (1 <= k <= n), she finds that 阅读全文

摘要： A Simple Problem with IntegersTime Limit: 5000/1500 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1038Accepted Submission(s): 371Problem DescriptionLet A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a giv 阅读全文

摘要： Transfer waterTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 2397Accepted Submission(s): 887Problem DescriptionXiaoA lives in a village. Last year flood rained the village. So they decide to move the whole village to the mountain nearby this year. 阅读全文

摘要： Command NetworkTime Limit: 1000MSMemory Limit: 131072KTotal Submissions: 8780Accepted: 2569DescriptionAfter a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and violent assault by KnuthOcean’s force has rendered a total failure of 阅读全文

摘要： The Unique MSTTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 15153Accepted: 5241DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of 阅读全文

摘要： Brackets SequenceTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 19636Accepted: 5437Special JudgeDescriptionLet us define a regular brackets sequence in the following way: 1. Empty sequence is a regular sequence.2. If S is a regular sequence, then (S) and [S] are both regular sequences.3. I 阅读全文