kuangbin - 博客园

HDU 4730 We Love MOE Girls （2013成都网络赛，签到水题）

摘要： We Love MOE GirlsTime Limit: 1000/500 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 208Accepted Submission(s): 157Problem DescriptionChikami Nanako is a girl living in many different parallel worlds. In this problem we talk about one of them.In this world, Nanako has 阅读全文

posted @ 2013-09-15 00:13 kuangbin 阅读(1322) 评论(0) 推荐(0)

HDU 4718 The LCIS on the Tree （动态树LCT）

摘要： The LCIS on the TreeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 175Accepted Submission(s): 40Problem DescriptionFor a sequence S1, S2, ... , SN, and a pair of integers (i, j), if 1 9 #include 10 #include 11 #include 12 #include 13 #includ... 阅读全文

posted @ 2013-09-13 22:33 kuangbin 阅读(1808) 评论(0) 推荐(0)

HDU 4727 The Number Off of FFF （水题）

摘要： The Number Off of FFFTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 78Accepted Submission(s): 36Problem DescriptionX soldiers from the famous "*FFF*army" is standing in a line, from left to right.You, as the captain of*FFF*, decides to h 阅读全文

posted @ 2013-09-11 17:47 kuangbin 阅读(1134) 评论(0) 推荐(0)

HDU 4726 Kia's Calculation（贪心）

摘要： Kia's CalculationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 83Accepted Submission(s): 16Problem DescriptionDoctor Ghee is teaching Kia how to calculate the sum of two integers. But Kia is so careless and alway forget to carry a number when 阅读全文

posted @ 2013-09-11 17:46 kuangbin 阅读(1708) 评论(0) 推荐(0)

HDU 4725 The Shortest Path in Nya Graph （最短路）

摘要： The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37Accepted Submission(s): 6Problem DescriptionThis is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un 阅读全文

posted @ 2013-09-11 17:44 kuangbin 阅读(4050) 评论(11) 推荐(0)

HDU 4720 Naive and Silly Muggles （简单计算几何）

摘要： Naive and Silly MugglesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24Accepted Submission(s): 17Problem DescriptionThree wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, which 阅读全文

posted @ 2013-09-11 17:38 kuangbin 阅读(1355) 评论(0) 推荐(0)

HDU 4717 The Moving Points （三分）

摘要： The Moving PointsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 72Accepted Submission(s): 18Problem DescriptionThere are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest dis 阅读全文

posted @ 2013-09-11 17:35 kuangbin 阅读(923) 评论(1) 推荐(0)

HDU 4716 A Computer Graphics Problem （水题）

摘要： A Computer Graphics ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 43Accepted Submission(s): 40Problem DescriptionIn this problem we talk about the study of Computer Graphics. Of course, this is very, very hard.We have designed a new mobile 阅读全文

posted @ 2013-09-11 17:34 kuangbin 阅读(786) 评论(0) 推荐(0)

SPOJ 1811. Longest Common Substring （LCS，两个字符串的最长公共子串，后缀自动机SAM）

摘要： 1811. Longest Common SubstringProblem code: LCSA string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set of lowercase letters.Substring, also called factor, is a consecutive sequence of characters occurrences at least once in a string.Now your task is simp 阅读全文

posted @ 2013-09-09 00:23 kuangbin 阅读(2123) 评论(0) 推荐(1)

HDU 4714 Tree2cycle （树形DP）

摘要： Tree2cycleTime Limit: 15000/8000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 324Accepted Submission(s): 54Problem DescriptionA tree with N nodes and N-1 edges is given. To connect or disconnect one edge, we need 1 unit of cost respectively. The nodes are labeled f 阅读全文

posted @ 2013-09-08 19:51 kuangbin 阅读(1275) 评论(0) 推荐(0)