Fork me on github

10 2018 档案

hdu1561 The more, The Better (树形DP)
摘要：The more, The Better Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9938 Accepted Submission(s): 阅读全文
posted @ 2018-10-21 20:42 acboyty 阅读(162) 评论(0) 推荐(0)
hdu 4405 Aeroplane chess (期望DP)
摘要：Aeroplane chess Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6257 Accepted Submission(s): 3891 阅读全文
posted @ 2018-10-19 20:11 acboyty 阅读(180) 评论(0) 推荐(0)
CodeForces - 1059C Sequence Transformation （GCD相关）
摘要：Let's call the following process a transformation of a sequence of length nn. If the sequence is empty, the process ends. Otherwise, append the greate 阅读全文
posted @ 2018-10-17 22:59 acboyty 阅读(149) 评论(0) 推荐(0)
hdu 1052 Tian Ji -- The Horse Racing (田忌赛马)
摘要：Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37056 Accepted Submis 阅读全文
posted @ 2018-10-17 22:47 acboyty 阅读(247) 评论(0) 推荐(0)
hdu 1028 Ignatius and the Princess III (n的划分)
摘要：Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26219 Accepted Subm 阅读全文
posted @ 2018-10-16 13:16 acboyty 阅读(173) 评论(0) 推荐(0)
CodeForces - 556D Case of Fugitive (贪心+排序)
摘要：Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water 阅读全文
posted @ 2018-10-15 17:17 acboyty 阅读(439) 评论(0) 推荐(0)
poj 3254 Corn Fields (状压DP入门)
摘要：Corn Fields Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20694 Accepted: 10855 Description Farmer John has purchased a lush new rectangu 阅读全文
posted @ 2018-10-14 16:36 acboyty 阅读(166) 评论(0) 推荐(0)
HYSBZ 1040 骑士 (基环外向树DP)
摘要：Z国的骑士团是一个很有势力的组织，帮会中汇聚了来自各地的精英。他们劫富济贫，惩恶扬善，受到社会各界的赞扬。最近发生了一件可怕的事情，邪恶的Y国发动了一场针对Z国的侵略战争。战火绵延五百里，在和平环境中安逸了数百年的Z国又怎能抵挡的住Y国的军队。于是人们把所有的希望都寄托在了骑士团的身上，就像期待有一 阅读全文
posted @ 2018-10-14 00:28 acboyty 阅读(254) 评论(0) 推荐(0)
CodeForces - 556C Case of Matryoshkas (水题)
摘要：Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art. The main exhib 阅读全文
posted @ 2018-10-13 21:30 acboyty 阅读(272) 评论(0) 推荐(0)
hdu 2955 Robberies (01背包好题)
摘要：Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31769 Accepted Submission(s): 11527 Pro 阅读全文
posted @ 2018-10-10 23:10 acboyty 阅读(168) 评论(0) 推荐(0)
hdu 1054 Strategic Game (简单树形DP)
摘要：Strategic Game Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10035 Accepted Submission(s): 46 阅读全文
posted @ 2018-10-08 21:42 acboyty 阅读(162) 评论(0) 推荐(0)
hdu 5532 Almost Sorted Array (水题)
摘要：Almost Sorted Array Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 8541 Accepted Submission(s) 阅读全文
posted @ 2018-10-07 19:44 acboyty 阅读(139) 评论(0) 推荐(0)
hdu 2089 不要62 (数位dp基础题)
摘要：不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 58665 Accepted Submission(s): 23095 Problem 阅读全文
posted @ 2018-10-06 16:30 acboyty 阅读(134) 评论(0) 推荐(0)
poj 2955 Brackets (区间dp基础题)
摘要：We give the following inductive definition of a “regular brackets” sequence: the empty sequence is a regular brackets sequence, if s is a regular brac 阅读全文
posted @ 2018-10-06 16:17 acboyty 阅读(150) 评论(0) 推荐(0)
nyoj 737 石子合并（区间DP）
摘要：737-石子合并（一） 内存限制:64MB 时间限制:1000ms 特判: No通过数:28 提交数:35 难度:3 题目描述: 有N堆石子排成一排，每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆，每次合并花费的代价为这两堆石子的和，经过N-1次合并后成为 阅读全文
posted @ 2018-10-05 21:08 acboyty 阅读(155) 评论(0) 推荐(0)
hdu 1010 Tempter of the Bone（深搜+奇偶剪枝）
摘要：Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 149833 Accepted Submission(s) 阅读全文
posted @ 2018-10-05 21:01 acboyty 阅读(153) 评论(0) 推荐(0)
poj 1679 The Unique MST （次小生成树模板题）
摘要：Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph 阅读全文
posted @ 2018-10-05 20:53 acboyty 阅读(146) 评论(0) 推荐(0)
hdu 1394 Minimum Inversion Number （树状数组求逆序对）
摘要：The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj. For a given sequence o 阅读全文
posted @ 2018-10-05 20:40 acboyty 阅读(146) 评论(0) 推荐(0)