![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
少见的
PoemK
这个作者很懒,什么都没留下…
展开
-
hdu 5291 Candy Distribution 2015 Multi-University Training Contest 1
Candy Distribution Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 234 Accepted Submission(s): 80 Problem Description WY h原创 2015-07-24 14:56:52 · 668 阅读 · 0 评论 -
UVA 104 Arbitrage DP(类似floyd)
Background The use of computers in the finance industry has been marked with controversy lately as programmed trading -- designed to take advantage of extremely small fluctuations in prices -- has be原创 2015-08-06 19:56:40 · 658 阅读 · 0 评论 -
hdu 5735 Born Slippy 折半枚举
题解上说的很清楚 折半枚举,mx[le][ri]代表往根结点方向的 某一节点j的权值前8位为le、当结点权值后8为为ri情况下的, 后8位操作和的最大值。 权值的大小有限,折半枚举时间正好。 #include #include #include #include #include #include #include using namespace std; #d原创 2016-07-27 14:02:32 · 435 阅读 · 0 评论