Others

Click Open Link Question: To a string, you must split it into several substrings so that each substring is a return string. The minimum number of splits. Analysis: F [I] indicates the minimum number of strings ending with I that can be

Question Link Directly simulate the computing process. It can be seen that the number displayed by the calculator is cyclical, and the key lies in how to determine whether or not the cycle is in the process of simulation. You can use map or

From http://blog.csdn.net/shuangde800 Question: Click to open the link Theme There are n kinds of bricks with the length, width, and height of X, Y, and Z, each of which has countless. Bricks can be built in different positions. Brick A can be

From http://blog.csdn.net/shuangde800 Click to open the link Question: Please refer to the following link for more information:Baidu encyclopedia In normal tower games, there are only three pillars, and if there are n discs, at least 2 ^ n-1 steps

Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & category = 456 & page = show_problem & problem = 2515 Question: To give a matrix, you must fill in the letters A to Z on it, so that the letters of each

From http://blog.csdn.net/shuangde800 Question: Click to open the link Question There are n hotels on a straight line road. The coordinates are di. Select K of the N hotels to build a parking lot. A hotel without a parking lot can only use the

Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & category = 108 & page = show_problem & problem = 267 Question type: backtracking Original question: Sorting an array can be done by swapping certain pairs

548-tree 4606 28.96% 974 77.21% Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & category = 104 & page = show_problem & problem = 489 Question type: data structure, binary

Learning Materials [KMP] matrix67: http://www.matrix67.com/blog/archives/115 [Expand KMP] Liu Yaqiong PPT: http://wenku.baidu.com/view/8e9ebefb0242a8956bece4b3.html [Application of the "minimal expression" concept in the character string loop

Link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3724 Question: Encoded barcodes Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1022 accepted submission (s): 337Problem descriptionall the

Link: Http://acm.hust.edu.cn/problem.php? Id = 1010 Question: Description There is a string. the length of a is less than 1,000,000. I rewrite it again and again. then I got a new string: aaaaaa ...... now I cut it from two different position and

Link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & category = & problem = 499 & mosmsg = Submission + received + with + ID + 10614453 Question: Wormholes In the

Link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & category = 24 & page = show_problem & problem = 1742 Question: Problem? Lift hopping Time Limit: 1 second Ted the bellhop:"I'm coming up and if

Link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3038 Question: Problem descriptiontt and FF are... friends. Uh... very good friends-________-B FF is a bad boy, he is always wooing TT to play the following game with him. this is a very

From http://blog.csdn.net/shuangde800 Question: Click to open the link. (Lrj Training Guide) There are n garbage items. The coordinate of the I garbage is (XI, Yi), and the weight is WI. A robot needs to pick up all the garbage from small to large

[LINK] Ultraviolet A: http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & category = 113 & page = show_problem & problem = 1611 Poj: http://poj.org/problem? Id = 1907 [Original question] Paperwork is beginning to pile up

784-mazeToken 7758 41.30% 2328 84.06% Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & category = 105 & page = show_problem & problem = 725 Question type: Search Sample

10004-bicoloring 32340 42.67% 8939 86.93% Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & amp; Itemid = 8 & amp; Category = 105 Question type: Search Question: In 1976 the ''four color map theorem "

10129-playOn words 8881 24.43% 1751 68.65% Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & category = 105 & page = show_problem & problem = 1070 Question type: Euler's

From http://blog.csdn.net/shuangde800 Question: Click to open the link Question Petra and Jan divide each person into N sweets, and each person can take one candy at a time.Each candy has two values X and Y. If Petra gets the value x, Jan gets the