- 博客(28)
- 资源 (2)
- 收藏
- 关注
转载 斜率优化 DP
斜率优化DPhttp://www.cnblogs.com/ka200812/archive/2012/08/03/2621345.html#3159481我们知道,有些DP方程可以转化成DP[i]=f[j]+x[i]的形式,其中f[j]中保存了只与j相关的量。这样的DP方程我们可以用单调队列进行优化,从而使得O(n^2)的复杂度降到O(n)。 可是并不是所有
2015-04-24 20:25:08 355
原创 hdoj 1423 Greatest Common Increasing Subsequence(最长上升公共子序列)
Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4801 Accepted Submission(s): 1529Problem De
2015-04-24 20:18:57 414
原创 快速幂模板(数+矩阵)
快速幂模板下面是 m^n % k 的快速幂:// m^n % kint quickpow(int m,int n,int k){ int b = 1; while (n > 0) { if (n & 1) b = (b*m)%k; m = (m*m)%k;
2015-04-23 19:21:09 438
原创 poj 3630 Phone List (字典树)
Phone ListTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 24093Accepted: 7387DescriptionGiven a list of phone numbers, determine if it is consistent
2015-04-18 20:46:36 419
原创 poj 2503 Babelfish(字典树)
Babelfish点击打开链接Time Limit: 3000MSMemory Limit: 65536KTotal Submissions: 35059Accepted: 15002DescriptionYou have just moved from Waterloo to a big city. Th
2015-04-18 19:49:13 480
原创 hdoj 1251 统计难题(经典字典树)
Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 84414 Accepted Submission(s): 31834Problem Descriptio
2015-04-18 10:44:04 682
原创 hdoj 1004 Let the Balloon Rise(模拟 || 字典树)
Let the Balloon Risehttp://acm.hdu.edu.cn/showproblem.php?pid=1004Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 84401 Accepted Subm
2015-04-18 10:26:08 1040
原创 poj 2001 Shortest Prefixes(字典树 )
Shortest PrefixesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14619 Accepted: 6310DescriptionA prefix of a string is a substring starting at the begi
2015-04-17 20:42:29 579
原创 hdoj 2527 Safe Or Unsafe(哈弗曼算法)
Safe Or Unsafehttp://acm.hdu.edu.cn/showproblem.php?pid=2527Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1653 Accepted Submission(
2015-04-14 22:22:37 762
原创 hdoj 1134 Game of Connections(卡特兰数&&大数)
Game of Connectionshttp://acm.hdu.edu.cn/showproblem.php?pid=1134Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3392 Accepted Submis
2015-04-14 21:40:30 739
转载 卡特兰数
卡特兰数分类: 数学2catalan number 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786.... 递推公式:令h(1)=1,h(0)=1, catalan数满足递归式: h(n)= h(0)*h(n-1)+h(1)*h(n-2) + ... + h(n-1)h(0) (其中
2015-04-14 15:28:14 392
原创 hdoj 2063 过山车(二分图匹配之匈牙利算法)
过山车http://acm.hdu.edu.cn/showproblem.php?pid=2063Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13019 Accepted Submission(s): 5709
2015-04-12 23:04:31 701
原创 基姆拉尔森计算公式
基姆拉尔森计算公式 算法如下:基姆拉尔森计算公式W= (d+2*m+3*(m+1)/5+y+y/4-y/100+y/400+1) mod 7在公式中d表示日期中的日数,m表示月份数,y表示年数。注意:在公式中有个与其他公式不同的地方:把一月和二月看成是上一年的十三月和十四月,例:如果是2004-1-10则换算成:2003-13-10来代入公式计算。
2015-04-12 17:41:35 1171
原创 hdoj 1081 To The Max
To The Maxhttp://acm.hdu.edu.cn/showproblem.php?pid=1081Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8989 Accepted Submission(s):
2015-04-12 16:18:30 364
原创 拓扑排序
拓扑排序源自:http://blog.csdn.net/u012860063?viewmode=contents把每个变量看成一个点,“小于”关系看成有向边,则我们得到了一个有向图。这样,我们的任务实际上是把一个图的所有结点排序,使得每一条有向边(u,v)对应的u都排在v的前面。在图论中,这个问题称为拓扑排序。 不难发现:如果图中存在有向环,则不存在拓扑排序,反之则存在
2015-04-08 21:43:44 507
转载 拓扑排序算法模板
拓扑排序算法:该算法是简单而直观的,实质上属于广度优先遍历,因此称为广度优先拓扑排序算法。算法包含下列几个步骤: [1] 从有向图中找一个没有前趋的结点v,若v不存在,则表明不可进行拓扑排序(图中有环路),结束(不完全成功); [2] 将v输出; [3] 将v从图中删除,同时删除关联于v的所有的边 [4] 若图
2015-04-08 20:53:49 404
原创 hdoj 1166 敌兵布阵 (树状数组)
敌兵布阵http://acm.hdu.edu.cn/showproblem.php?pid=1166Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51862 Accepted Submission(s): 21695
2015-04-08 20:29:24 511
原创 hdoj 4500 小Q系列故事——屌丝的逆袭(动态规划)
小Q系列故事——屌丝的逆袭http://acm.hdu.edu.cn/showproblem.php?pid=4500Time Limit: 300/100 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 5383 Accepted Submission(s):
2015-04-06 20:18:48 525
原创 hdoj 2817 A sequence of numbers(快速幂取模)
A sequence of numbershttp://acm.hdu.edu.cn/showproblem.php?pid=2817Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4046 Accepted Subm
2015-04-06 20:07:48 445
原创 hdoj 1331 Function Run Fun(模拟)
Function Run Funhttp://acm.hdu.edu.cn/showproblem.php?pid=1331Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2587 Accepted Submissio
2015-04-06 20:03:25 419
原创 hdoj 2682 Tree(最小生成树)
Treehttp://acm.hdu.edu.cn/showproblem.php?pid=2682Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1855 Accepted Submission(s): 544
2015-04-06 19:56:22 461
原创 hdoj 1162 Eddy's picture(最小生成树)
Eddy's picturehttp://acm.hdu.edu.cn/showproblem.php?pid=1162Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7521 Accepted Submission(
2015-04-06 19:46:19 441
原创 hdoj 2544 最短路
最短路http://acm.hdu.edu.cn/showproblem.php?pid=2544Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37233 Accepted Submission(s): 16199
2015-04-06 19:26:00 423
原创 hdoj Asteroids! (BFS)
Asteroids!http://acm.hdu.edu.cn/showproblem.php?pid=1240Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3819 Accepted Submission(s):
2015-04-06 18:45:46 352
原创 最长上升子序列
最长上升子序列 最近在做单调队列,发现了最长上升子序列O(nlogn)的求法也有利用单调队列的思想。 最长递增子序列问题:在一列数中寻找一些数,这些数满足:任意两个数a[i]和a[j],若i 设dp[i]表示以i为结尾的最长递增子序列的长度,则状态转移方程为:dp[i] = max{dp[j]+1}, 1 这样简单的复杂度为O(n
2015-04-05 23:08:45 418
原创 hdoj 1686 Oulipo(KMP算法)
Oulipohttp://acm.hdu.edu.cn/showproblem.php?pid=1686Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5903 Accepted Submission(s): 2370
2015-04-02 16:56:22 584
原创 hdoj 1242 Rescue (BFS)
Rescuehttp://acm.hdu.edu.cn/showproblem.php?pid=1242Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18962 Accepted Submission(s): 677
2015-04-01 20:23:40 492
原创 hdoj 1556 Color the ball(树状数组)
Color the ballhttp://acm.hdu.edu.cn/showproblem.php?pid=1556Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11101 Accepted Submission
2015-04-01 10:35:36 417
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人