11 2014 档案

ACM学习历程——POJ 1700 Crossing River(贪心)
摘要:DescriptionA group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arr... 阅读全文

posted @ 2014-11-23 12:14 AndyQsmart 阅读(331) 评论(0) 推荐(0)

ACM学习历程——POJ 2376 Cleaning Shifts(贪心)
摘要:Description Farmer John is assigning some of his N (1 #include #include #include #include #include #include #include #include #include #include #defin... 阅读全文

posted @ 2014-11-23 12:05 AndyQsmart 阅读(261) 评论(0) 推荐(0)

ACM学习历程——HDU1331 Function Run Fun(锻炼多维dp的打表)
摘要:Description We all love recursion! Don't we? Consider a three-parameter recursive function w(a, b, c): if a 20 or b > 20 or c > 20, then w(a, b, c) r... 阅读全文

posted @ 2014-11-20 20:32 AndyQsmart 阅读(276) 评论(0) 推荐(0)

ACM学习历程——POJ3295 Tautology(搜索,二叉树)
摘要:DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q,... 阅读全文

posted @ 2014-11-20 20:15 AndyQsmart 阅读(249) 评论(0) 推荐(0)

ACM学习历程—HDU2222 Keywords Search(字典树)
摘要:Keywords SearchDescription In the modern time, Search engine came into the life of everybody like Google, Baidu, etc. Wiskey also wants to bring this... 阅读全文

posted @ 2014-11-16 19:20 AndyQsmart 阅读(271) 评论(0) 推荐(0)

ACM学习历程—HDU4956 Poor Hanamichi(模拟)
摘要:Poor HanamichiProblem DescriptionHanamichi is taking part in a programming contest, and he is assigned to solve a special problem as follow: Given a r... 阅读全文

posted @ 2014-11-16 19:18 AndyQsmart 阅读(189) 评论(0) 推荐(0)

ACM学习历程—HDU1392 Surround the Trees(计算几何)
摘要:DescriptionThere are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the minimal requir... 阅读全文

posted @ 2014-11-16 19:16 AndyQsmart 阅读(238) 评论(0) 推荐(0)

ACM学习历程—HDU1028 Ignatius and the Princess(组合数学)
摘要:Ignatius and the Princess Description "Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says. "T... 阅读全文

posted @ 2014-11-16 19:14 AndyQsmart 阅读(241) 评论(0) 推荐(0)

ACM学习历程——HDU 5014 Number Sequence (贪心)(2014西安网赛)
摘要:DescriptionThere is a special number sequence which has n+1 integers. For each number in sequence, we have two rules:● ai∈ [0,n]● ai≠ aj( i ≠ j )For s... 阅读全文

posted @ 2014-11-01 17:24 AndyQsmart 阅读(429) 评论(0) 推荐(0)

ACM学习历程——HDU5017 Ellipsoid(模拟退火)(2014西安网赛K题)
摘要:---恢复内容开始---DescriptionGiven a 3-dimension ellipsoid(椭球面)your task is to find the minimal distance between the original point (0,0,0) and points on th... 阅读全文

posted @ 2014-11-01 14:52 AndyQsmart 阅读(322) 评论(0) 推荐(0)

导航