关闭

HDU 3335 Divisibility(Dilworth定理+最小路径覆盖)

Divisibility Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2043    Accepted Submission(s): 823 Problem Description As we know,the...
阅读(6) 评论(0)

HDU 6141 I am your Father!(最小树形图+权值编码)

I am your Father! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 173    Accepted Submission(s): 37 Problem Description > Darth Vad...
阅读(201) 评论(0)

BZOJ 4337 树的同构(树的hash)

4337: BJOI2015 树的同构 Time Limit: 10 Sec  Memory Limit: 256 MB Submit: 684  Solved: 282 [Submit][Status][Discuss] Description 树是一种很常见的数据结构。 我们把N个点,N-1条边的连通无向图称为树。 若将某个点作为根,从根开始遍历,则其它的点都有一个前驱,...
阅读(27) 评论(0)

HDU 4495 Rectangle(前缀hash)

Rectangle Time Limit: 10000/10000 MS (Java/Others)    Memory Limit: 65535/102400 K (Java/Others) Total Submission(s): 529    Accepted Submission(s): 195 Problem Description Given a rectang...
阅读(28) 评论(0)

UVa 12161 Ironman Race in Treeland(树分治)

题目大意:     有一棵树,每条边上都有花费和长度,求花费不超过M的最长路径。 解题思路:     比较典型的树分治,对于每个重心,统计所有经过重心的路径的组合,再加上原始输入的边,一定能够得到所有的路径。在计算组合的时候,直接暴力枚举非常低效,我们可以先去掉花费大,长度短的路径,然后排序利用双指针(具体写法间代码)。 AC代码: #include #include ...
阅读(23) 评论(0)

POJ 3155 Hard Life(最大密度子图)

Hard Life Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 9111 Accepted: 2648 Case Time Limit: 2000MS Special Judge DescriptionJohn is a Chief Executive Officer at a private...
阅读(36) 评论(0)

POJ 2728 Desert King(最优比率生成树)

Desert King Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 26364 Accepted: 7307 Description David the Great has just become the king of a desert country. To win the respect of his peo...
阅读(47) 评论(0)

HDU 1599 find the mincost route(无向图最小环)

find the mincost route Time Limit: 1000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5648    Accepted Submission(s): 2269 Problem Description 杭州有...
阅读(42) 评论(0)

HDU 4085 Peach Blossom Spring(斯坦纳树)

Peach Blossom Spring Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2808    Accepted Submission(s): 1087 Problem Description ...
阅读(25) 评论(0)

HDU 4285 circuits(回路不能嵌套的插头DP)

circuits Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1149    Accepted Submission(s): 393 Problem Description   Given a map of...
阅读(31) 评论(0)

ZOJ 3256 Tour in the Castle(插头DP+矩阵快速幂)

Tour in the Castle Time Limit: 5 Seconds      Memory Limit: 32768 KB After the final BOSS is defeated, the hero found that the whole castle is collapsing (very familiar scene, isn't it). Escap...
阅读(27) 评论(0)

HDU 6072 Logical Chain(Kosaraju+bitset优化)

Logical Chain Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 71    Accepted Submission(s): 28 Problem Description Every time yo...
阅读(121) 评论(0)

HDU 6076 Security Check(分情况DP)

Security Check Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 211    Accepted Submission(s): 84 Problem Description In airport o...
阅读(177) 评论(0)

HDU 6071 Lazy Running(同余+最短路)

Lazy Running Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 287    Accepted Submission(s): 126 Problem Description In HDU, you h...
阅读(452) 评论(5)

POJ 3133 Manhattan Wiring(限制匹配的插头DP)

Manhattan Wiring Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 1921   Accepted: 1130 Description There is a rectangular area containing n × m cells. Tw...
阅读(36) 评论(0)
138条 共10页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:24957次
    • 积分:1570
    • 等级:
    • 排名:千里之外
    • 原创:136篇
    • 转载:2篇
    • 译文:0篇
    • 评论:22条
    文章分类
    最新评论