摘要： IntervalsTime Limit:5000MSMemory Limit:65536KTotal Submissions:5762Accepted:2288DescriptionYou are givenNweighted open intervals. Theith interval covers (ai,bi) and weighswi. Your task is to pick some of the intervals to maximize the total weights under the limit that no point in the real axis is co 阅读全文

摘要： Kaka's Matrix TravelsTime Limit:1000MSMemory Limit:65536KTotal Submissions:6792Accepted:2679DescriptionOn anN×Nchessboard with a non-negative number in each grid, Kaka starts his matrix travels withSUM= 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bottom one 阅读全文

摘要： 转载地址：http://blog.csdn.net/onepiecehuiyu/article/details/8934366http://mawenhao19930620.blog.163.com/blog/static/12857536120112991818242/Windows下gvim配置文件_vimrc首先配置g++到环境变量(配置g++,具体是将devc++的g++.exe的路径比如说：c:/deVC++/bin..加入到环境变量path里面) ， 然后将下面的代码复制并保存为_vimrc ， 替换掉vim安装文件夹中的_vimrc文件（或者是打开Vim的启动设定，然后复制下面的 阅读全文

摘要： Swipe BoTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 455Accepted Submission(s): 111Problem Description“Swipe Bo” is a puzzle game that requires foresight and skill.The main character of this game is a square blue tofu called Bo. We can swipe up 阅读全文

摘要： Who's Aunt ZhangTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19Accepted Submission(s): 16Problem DescriptionAunt Zhang, well known as 张阿姨, is a fan of Rubik’s cube. One day she buys a new one and would like to color it as a gift to send to T 阅读全文

摘要： Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65535 K (Java/Others)Total Submission(s): 88Accepted Submission(s): 26Problem DescriptionIn mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing t 阅读全文

摘要： Strongly connectedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 53Accepted Submission(s): 15Problem DescriptionGive a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is sti 阅读全文

摘要： GroupTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17Accepted Submission(s): 5Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men stan 阅读全文

摘要： HeheTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33Accepted Submission(s): 22Problem DescriptionAs we all know, Fat Brother likes MeiZi every much, he always find some topic to talk with her. But as Fat Brother is so low profile that no one know 阅读全文

摘要： Fliping gameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 46Accepted Submission(s): 35Problem DescriptionAlice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board wit 阅读全文