kuangbin - 博客园

HDU 4405 Aeroplane chess 第37届ACM/ICPC 金华赛区网络赛（递推求期望）

摘要： Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 229Accepted Submission(s): 158Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws 阅读全文

posted @ 2012-09-22 22:48 kuangbin 阅读(969) 评论(0) 推荐(0) 编辑

HDU 4407 Sum 第37届ACM/ICPC 金华赛区第1008题（容斥原理）

摘要： SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 358Accepted Submission(s): 109Problem DescriptionXXX is puzzled with the question below: 1, 2, 3, ..., n (1<=n<=400000) are placed in a line. There are m (1<=m<=1000) operations of two 阅读全文

posted @ 2012-09-22 22:45 kuangbin 阅读(1656) 评论(0) 推荐(0) 编辑

HDU 4408 Minimum Spanning Tree 第37届ACM/ICPC 金华赛区网络赛1009 题（最小生成树计数）

摘要： Minimum Spanning TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 205Accepted Submission(s): 65Problem DescriptionXXX is very interested in algorithm. After learning the Prim algorithm and Kruskal algorithm of minimum spanning tree, XXX finds th 阅读全文

posted @ 2012-09-22 21:20 kuangbin 阅读(1987) 评论(0) 推荐(0) 编辑

HDU 4403 A very hard Aoshu problem 第37届ACM/ICPC 金华赛区网络赛1004题

摘要： A very hard Aoshu problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 137Accepted Submission(s): 100Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary 阅读全文

posted @ 2012-09-22 20:54 kuangbin 阅读(1023) 评论(0) 推荐(0) 编辑

POJ 1470 Closest Common Ancestors （LCA入门题）

摘要： Closest Common AncestorsTime Limit: 2000MSMemory Limit: 10000KTotal Submissions: 11659Accepted: 3848DescriptionWrite a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest common ancestor of u and v in the tree. The closest 阅读全文

posted @ 2012-09-21 19:08 kuangbin 阅读(609) 评论(0) 推荐(0) 编辑

POJ 1330 Nearest Common Ancestors （LCA入门题）

摘要： Nearest Common AncestorsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12478Accepted: 6652DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 . 阅读全文

posted @ 2012-09-21 19:07 kuangbin 阅读(1388) 评论(0) 推荐(0) 编辑

HDU 3183 A Magic Lamp （双向链表贪心删除或者是 RMQ取数）

摘要： A Magic LampTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 745Accepted Submission(s): 271Problem DescriptionKiki likes traveling. One day she finds a magic lamp, unfortunately the genie in the lamp is not so kind. Kiki must answer a question, and 阅读全文

posted @ 2012-09-21 12:36 kuangbin 阅读(590) 评论(0) 推荐(0) 编辑

HDU 1806 Frequent values(RMQ)

摘要： Frequent valuesTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 778Accepted Submission(s): 259Problem DescriptionYou are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries co 阅读全文

posted @ 2012-09-20 22:18 kuangbin 阅读(1710) 评论(0) 推荐(1) 编辑

POJ 1787 Charlie's Change （完全背包，记录路径）

摘要： Charlie's ChangeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 2215Accepted: 575DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. Charlie drives a lot and so he often buys coffee at coffee vending machines at motorests. Charlie hates change. That is basically the setup of 阅读全文

posted @ 2012-09-20 19:16 kuangbin 阅读(1622) 评论(2) 推荐(1) 编辑

POJ 3181 Dollar Dayz （完全背包）

摘要： Dollar DayzTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2275Accepted: 934DescriptionFarmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer John has exactly $5 阅读全文

posted @ 2012-09-20 14:20 kuangbin 阅读(3824) 评论(5) 推荐(1) 编辑