cactushao
疯狂的橡树
code can change world
展开
-
hdu1074:doing homework(状压dp)
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6308 Accepted Submission(s): 2714Problem DescriptionIgnatius ha原创 2015-08-01 19:49:24 · 495 阅读 · 0 评论 -
组合数取模(数论)
组合数取模在ACM竞赛中是一个很重要的问题,很多选手因为数据太大而束手无策,今天就来详细讲解它。 组合数取模就是求的值,当然根据,和的取值范围不同,采取的方法也不一样。 接下来,我们来学习一些常见的取值情况 (1)和 这个问题比较简单,组合数的计算可以靠杨辉三角,那么由于和的范围小,直接两层循环即可。 (2)转载 2015-08-07 09:44:41 · 645 阅读 · 0 评论 -
hdu 3624 City Planning(暴力,也可扫描线)
City PlanningTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 503 Accepted Submission(s): 213Problem DescriptionAfter many yea原创 2015-08-19 15:36:18 · 792 阅读 · 0 评论 -
树形dp
树,一种十分优美的数据结构,因为它本身就具有的递归性,所以它和子树见能相互传递很多信息,还因为它作为被限制的图在上面可进行的操作更多,所以各种用于不同地方的树都出现了,二叉树、三叉树、静态搜索树、AVL树,线段树、SPLAY树,后缀树等等.. 枚举那么多种数据结构只是想说树方面的内容相当多,本专辑只针对在树上的动态规划,即树形DP.做树形DP一般步骤是先将树转换为有根树,然后在树上转载 2015-08-17 09:02:30 · 1143 阅读 · 0 评论 -
HDU 1024 Max Sum Plus Plus((最大m段子段和))(动态规划经典)
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20343 Accepted Submission(s): 6721Problem DescriptionNow I t原创 2015-08-03 20:39:07 · 760 阅读 · 0 评论 -
CodeForces 148E Porcelain(dp+背包)
E. Porcelaintime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuring her tantrums the princess usually smash原创 2015-08-03 15:40:59 · 635 阅读 · 0 评论 -
FZU 1853 Number Deletion(贪心)
Problem 1853 Number DeletionAccept: 83 Submit: 258Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionGiven you one n-digital positive integer a,After removing any原创 2015-08-12 10:43:27 · 593 阅读 · 0 评论 -
codeforces 67A Partial Teacher( 贪心)
A. Partial Teachertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA teacher decides to give toffees to his原创 2015-08-03 14:41:20 · 492 阅读 · 0 评论 -
ZOJ 3587 fsdgsdsvds(dp+sstiti)
Marlon's StringTime Limit: 2 Seconds Memory Limit: 65536 KBLong long ago, there was a coder named Marlon. One day he picked two string on the street. A problem suddenly crash his brain...原创 2015-07-31 20:17:30 · 257 阅读 · 0 评论 -
CF 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原创 2015-08-20 08:56:28 · 1022 阅读 · 0 评论