- 博客(179)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 hdu 1522 Marriage is Stable（稳定婚姻问题）
Marriage is StableTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1266 Accepted Submission(s): 667Special JudgeProblem Descriptio
2017-08-21 18:03:26
643
原创 HDU 3335 Divisibility（Dilworth定理+最小路径覆盖）
DivisibilityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2043 Accepted Submission(s): 823Problem DescriptionAs we know,the
2017-08-20 19:50:20
878
原创 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): 37Problem Description> Darth Vad
2017-08-18 09:41:15
1202
原创 BZOJ 4337 树的同构（树的hash）
4337: BJOI2015 树的同构Time Limit: 10 Sec Memory Limit: 256 MBSubmit: 684 Solved: 282[Submit][Status][Discuss]Description树是一种很常见的数据结构。我们把N个点，N-1条边的连通无向图称为树。若将某个点作为根，从根开始遍历，则其它的点都有一个前驱，
2017-08-15 09:23:58
407
原创 HDU 4495 Rectangle（前缀hash）
RectangleTime Limit: 10000/10000 MS (Java/Others) Memory Limit: 65535/102400 K (Java/Others)Total Submission(s): 529 Accepted Submission(s): 195Problem DescriptionGiven a rectang
2017-08-14 10:40:31
665
原创 UVa 12161 Ironman Race in Treeland（树分治）
题目大意： 有一棵树，每条边上都有花费和长度，求花费不超过M的最长路径。解题思路： 比较典型的树分治，对于每个重心，统计所有经过重心的路径的组合，再加上原始输入的边，一定能够得到所有的路径。在计算组合的时候，直接暴力枚举非常低效，我们可以先去掉花费大，长度短的路径，然后排序利用双指针（具体写法间代码）。AC代码：#include #include
2017-08-13 09:38:17
723
原创 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
2017-08-11 10:48:48
501
原创 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
2017-08-09 21:08:19
463
原创 HDU 1599 find the mincost route（无向图最小环）
find the mincost routeTime Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5648 Accepted Submission(s): 2269Problem Description杭州有
2017-08-09 14:55:20
692
原创 HDU 4085 Peach Blossom Spring（斯坦纳树）
Peach Blossom SpringTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2808 Accepted Submission(s): 1087Problem Description
2017-08-08 18:57:58
646
原创 HDU 4285 circuits（回路不能嵌套的插头DP）
circuitsTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1149 Accepted Submission(s): 393Problem Description Given a map of
2017-08-07 13:41:10
494
原创 ZOJ 3256 Tour in the Castle（插头DP+矩阵快速幂）
Tour in the CastleTime Limit: 5 Seconds Memory Limit: 32768 KBAfter the final BOSS is defeated, the hero found that the whole castle is collapsing (very familiar scene, isn't it). Escap
2017-08-06 19:57:43
378
原创 HDU 6072 Logical Chain（Kosaraju+bitset优化）
Logical ChainTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 71 Accepted Submission(s): 28Problem DescriptionEvery time yo
2017-08-05 20:16:34
1366
3
原创 HDU 6076 Security Check（分情况DP）
Security CheckTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 211 Accepted Submission(s): 84Problem DescriptionIn airport o
2017-08-05 15:54:47
1143
原创 HDU 6071 Lazy Running（同余+最短路）
Lazy RunningTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 287 Accepted Submission(s): 126Problem DescriptionIn HDU, you h
2017-08-04 15:13:36
1472
5
原创 POJ 3133 Manhattan Wiring（限制匹配的插头DP）
Manhattan WiringTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1921 Accepted: 1130DescriptionThere is a rectangular area containing n × m cells. Tw
2017-08-02 20:32:07
459
原创 HDU 6064 RXD and numbers（BEST theorem）
RXD and numbersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 40 Accepted Submission(s): 16Problem Description RXD has a sequence A1,A2,
2017-08-02 11:09:22
1250
原创 HDU 5361 In Touch（并查集实现区间删除）
In TouchTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2302 Accepted Submission(s): 617Problem DescriptionThere are n soda
2017-08-01 09:18:53
366
原创 URAL 1519 Formula 1（插头DP）
1519. Formula 1Time limit: 1.0 secondMemory limit: 64 MBBackgroundRegardless of the fact, that Vologda could not get rights to hold the Winter Olympic games of 20**, it is well-known,
2017-07-31 13:52:07
647
原创 Codeforces 8C Looking for Order（状压DP）
C. Looking for Ordertime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputGirl Lena likes it when everything is
2017-07-30 19:30:01
714
原创 HDU 6046 hash（搜索标识）
hashTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 122 Accepted Submission(s): 33Problem DescriptionQscqesze is busy at d
2017-07-28 11:16:48
496
原创 HDU 6048 Puzzle（滑块游戏）
PuzzleTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 92 Accepted Submission(s): 48Problem DescriptionA Jigsaw puzzle conta
2017-07-28 08:47:10
1474
原创 HDU 6041 I Curse Myself（仙人掌+tanjan）
I Curse MyselfTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 475 Accepted Submission(s): 76Problem DescriptionThere is a c
2017-07-26 18:45:36
1724
原创 HDU 6040 Hints of sd0061（快速排序）
Hints of sd0061Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 520 Accepted Submission(s): 112Problem Descriptionsd0061, th
2017-07-26 13:35:56
498
原创 HDU 6035 Colorful Tree（虚树）
Colorful TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 443 Accepted Submission(s): 155Problem DescriptionThere is a t
2017-07-26 10:11:18
2050
原创 博客推荐
康托展开：http://blog.csdn.net/zhongkeli/article/details/6966805斜率优化DP：http://www.cnblogs.com/ka200812/archive/2012/08/03/2621345.html（博主有个笔误，例子中应该是下凸函数，图也画错了）
2017-07-17 18:18:01
383
原创 UVA 11149 Power of Matrix（求幂函数的前n项和）
题目大意： 给你一个矩阵A，求A^1+A^2+A^3+...+A^n解题思路： 利用和快速幂一样的思想，我们可以对原式变形。 当n为偶数的时候： 当n为奇数的时候： 所以，我们就可以用递归每次先求出n/2的前n项和，然后利用矩阵快速幂和上面的式子得到前n项和。时间复杂度为O(logn*logn)。AC代码：
2017-07-15 20:52:17
893
原创 HDU 4965 Fast Matrix Calculation（矩阵快速幂）
Fast Matrix CalculationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1700 Accepted Submission(s): 784Problem DescriptionO
2017-07-15 19:14:14
346
原创 UVA 11651 Krypton Number System（矩阵加速DP）
题目大意： 对于一个没有前导0，相邻位数不相同的N（2解题思路： 首先我们就可想到dp[i][j]表示得分为i，最后一位为j的方案数，转移方程为。不过由于S太大，需要使用矩阵加速。 由于转移最多(N-1)*(N-1)*N个值，所以我们的结果矩阵的边长就要有(N-1)*(N-1)*N。按照转移方程就可以构造矩阵，然后快速幂得到结果。 以N=3为例：
2017-07-15 17:37:31
638
原创 HDU 3605 Escape（最大流+合并点）
EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 10116 Accepted Submission(s): 2424Problem Description2012 If this is th
2017-07-14 08:54:14
495
1
原创 HDU 4687 Boke and Tsukkomi（一般图匹配+枚举）
Boke and TsukkomiTime Limit: 3000/3000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 1232 Accepted Submission(s): 394Problem DescriptionA new s
2017-07-12 18:27:42
529
原创 SHUoj 421 零件组装（状压DP+子状态枚举）
零件组装发布时间: 2017年7月9日 18:17 最后更新: 2017年7月9日 21:04 时间限制: 1000ms 内存限制: 128M描述现有n个零件，小Y花费了很多时间来收集它们，现在他想把零件拼在一起，拼完就可以召唤神龙了。已知零件之间存在相邻的关系，拥有相邻关系的零件在最终的组装结果中就是相邻的，并且组装过程中每次只能通过相邻关系来组合零件。小
2017-07-12 09:56:05
676
原创 HDU 3829 Cat VS Dog（最大独立集）
Cat VS DogTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 3858 Accepted Submission(s): 1387Problem DescriptionThe zoo have N
2017-07-10 20:23:07
385
原创 HDU 2594 Treasure Exploration（有向图最小可重叠路径覆盖）
Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 8570 Accepted: 3500DescriptionHave you ever read any book about treasure explorati
2017-07-10 18:56:46
468
原创 HDU 1045 Fire Net（二分图最大匹配）
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12126 Accepted Submission(s): 7315Problem DescriptionSuppose that we
2017-07-10 14:26:20
308
原创 HDU 4685 Prince and Princess（求所有二分图最大匹配）
Prince and PrincessTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1847 Accepted Submission(s): 543Problem DescriptionThere a
2017-07-10 11:13:31
417
原创 HDU 4635 Strongly connected（构造最大非强连通图）
Strongly connectedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2887 Accepted Submission(s): 1193Problem DescriptionGive a
2017-07-09 21:06:46
517
原创 HDU 4408 Minimum Spanning Tree（最小生成树计数）
Minimum Spanning TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2033 Accepted Submission(s): 686Problem DescriptionXXX i
2017-07-08 14:09:04
479
原创 HDU 2121 Ice_cream’s world II（不定根最小树形图）
Ice_cream’s world IIProblem DescriptionAfter awarded lands to ACMers, the queen want to choose a city be her capital. This is an important event in ice_cream world, and it also a very difficult problem, because the world have N cities and M roads, ever
2017-07-05 15:03:10
321
原创 次小生成树的Kruskal实现
通常次小生成树是使用Prim算法进行实现的，因为可以在Prim算法松弛的同时求得最小生成树上任意两点之间的最长边。但是利用Kruskal算法却没办法在松弛的同时求得。 所以我们就要在Kruskal求完最短路后，对于每个顶点bfs一次，得到树上任意两点的最长边。之后求可以像之前一样枚举不在树上的边，代替找最小值了。 两种方法的时间杂度是一样的，但Kruskal的实现代码回长非常多
2017-07-03 21:53:10
1233
空空如也
Xcode无法编译C++求解决
2017-06-20
TA创建的收藏夹 TA关注的收藏夹
TA关注的人