回顾
PoemK
这个作者很懒,什么都没留下…
展开
-
hdu 5200 Trees 排序+思维? ★★☆
TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1282 Accepted Submission(s): 398Problem DescriptionToday CodeFamer is go原创 2015-12-17 16:21:48 · 444 阅读 · 0 评论 -
hdu 4281 Judges' response 状压DP+TSP ★★★★
Judges' responseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 678 Accepted Submission(s): 389Problem Description The conte原创 2015-12-06 12:20:56 · 674 阅读 · 0 评论 -
uva 147 - Dollars 钱币兑换问题(浮点数) 精度问题 完全背包
题目:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=83&mosmsg=Submission+received+with+ID+16544004要对精度作出处理,其余和一般的钱币兑换问题一样。对于计数dp,一定要想到l原创 2015-12-06 15:31:25 · 540 阅读 · 0 评论 -
poj 3181 Dollar Dayz 钱币兑换问题 大数/高精度 完全背包
Dollar DayzTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5289 Accepted: 2006DescriptionFarmer John goes to Dollar Days at The Cow Store and discover原创 2015-12-06 18:35:53 · 545 阅读 · 0 评论 -
poj 3260 The Fewest Coins 混合背包+上限处理 ★★★
The Fewest CoinsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5872 Accepted: 1763DescriptionFarmer John has gone to town to buy some farm supplies.原创 2015-12-07 11:52:08 · 394 阅读 · 0 评论 -
poj 2063 Investment 贪心+完全背包
InvestmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9598 Accepted: 3335DescriptionJohn never knew he had a grand-uncle, until he received the no原创 2015-12-07 17:31:30 · 344 阅读 · 0 评论 -
ZOJ 3623 Battle Ships 造战舰炸塔 动态规划 伪装较好的完全背包 ★★★
Battle ShipsTime Limit: 2 Seconds Memory Limit: 65536 KB Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which hasL longev原创 2015-12-08 18:48:38 · 640 阅读 · 0 评论 -
zoj 3524 Crazy Shopping 拓扑排序+完全背包 ★★★☆
Crazy ShoppingTime Limit: 3 Seconds Memory Limit: 65536 KBBecause of the 90th anniversary of the Coherent & Cute Patchouli (C.C.P), Kawashiro Nitori decides to buy a lot of rare things to原创 2015-12-10 16:30:54 · 438 阅读 · 0 评论 -
ZOJ 3662 Math Magic 分阶段的动态规划 (+离散化) ★★★☆
Math MagicTime Limit: 3 Seconds Memory Limit: 32768 KBYesterday, my teacher taught us about math: +, -, *, /, GCD, LCM... As you know, LCM (Least common multiple) of two positive number原创 2015-12-11 16:52:56 · 498 阅读 · 0 评论 -
hdu 3810 Magina 5亿的背包,队列优化DP
MaginaTime Limit: 60000/30000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 663 Accepted Submission(s): 212Problem DescriptionMagina, also known原创 2016-01-19 19:37:57 · 610 阅读 · 0 评论 -
poj 1741 Tree 树形DP + 树分治 ★★★★
TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15090 Accepted: 4913DescriptionGive a tree with n vertices,each edge has a length(positive integer原创 2015-12-28 22:35:46 · 367 阅读 · 0 评论 -
uva 1627 Team them up! 团队分组
题目:点我感觉自己好像做麻烦了,这个题目的思考方式是,对于不能在一组的连线,这样所有点就被分为一些连通块。假如可以分组,每一个连通块就是一个泛化物品,价值可正可负。这是因为,能在一组的点,可以在一组,也可以不在一组,不能在一组的点一定不能在一组,这样保证了不能的情况,简化了问题。/**=============================原创 2016-02-04 20:32:15 · 782 阅读 · 0 评论 -
hdu 3466 Proud Merchants 01背包 (顺序性)
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3989 Accepted Submission(s): 1658Problem DescriptionRecently,原创 2015-12-04 13:26:36 · 382 阅读 · 0 评论 -
UVA 674 Coin Change 钱币兑换问题 类似完全背包
题目:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=615虽然网上说这是基础题,感觉其实并不简单,虽然有人将此题归为完全背包,但感觉和经典的背包转移还是有些差别。dp[x][i]表示体积为x时的,前i种物原创 2015-12-02 16:42:05 · 417 阅读 · 0 评论 -
KMP 整理
hdu 1686 Oulipo/**========================================== * This is a solution for ACM/ICPC problem * * @source£ºhdu 1686 Oulipo * @type: dp * @author: wust_ysk * @blog: htt原创 2016-01-24 22:48:15 · 439 阅读 · 0 评论 -
hdu 1598 find the most comfortable road 枚举+并查集
并查集:可用于判断两点是否连通,此题点的数量级为百,边的数量级为千,每组数据查询的次数11次,而且只需输出最终答案,不用输出路径,所以给我的第一可行感觉就是二分,然而二分是可行的,但我没想出来,然后就想到去枚举,巧妙的用并查集来判断枚举的边集是否可以将给出的两点x、y连通。解法:将边从小到大排序,枚举一个区间的起点和终点,然后求最优值。 for(int i=1;i{原创 2016-02-07 13:35:40 · 414 阅读 · 0 评论 -
hdu 1811 Rank of Tetris 拓扑排序+并查集
拓扑排序的过程中,根据队列中是否出现多个入度为0的点,可以判断出信息是否完全。根据拓扑排序访问过的点数,可以判断出是否存在环,也就是信息之间是否存在矛盾。Rank of TetrisTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Subm原创 2016-02-08 12:32:30 · 364 阅读 · 0 评论 -
hdu 4081 Qin Shi Huang's National Road System 秦始皇的国家公路系统
最小生成树的一个性质:假若去掉最小生成树中的一条边,那么其他点,就组成两个连通分量,最小生成树中其他边的权值和就是让这两个连通分量中的点分别连通的最小花费。很好证明。Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 3原创 2016-02-10 14:39:04 · 677 阅读 · 0 评论 -
错误总结
今天比赛时用double ans=....;int ANS=ans;printf("%d\n",ANS);进行四舍五入现在想想也是傻,当时因为知道ans是个整数,就直接用int存。发生了灾难性的错误,由于ANS为整数,但是double是不精确的,我们机器上跑出20,结果判题机上偏偏是19。下次:printf("%.0f\n",ans);原创 2016-04-17 17:46:28 · 397 阅读 · 0 评论 -
poj 2486 Apple Tree 树形背包 ★
给出一棵苹果树,每个结点有一定的苹果,现在在结点1,最多走K步,问最多吃多少颗苹果。原创 2016-01-14 23:02:08 · 812 阅读 · 0 评论 -
ZOJ 3329 One Person Game 概率DP 求期望 待定系数法 ★
One Person GameTime Limit: 1 Second Memory Limit: 32768 KB Special JudgeThere is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 ha原创 2015-12-22 17:16:22 · 784 阅读 · 0 评论 -
hdu 4035 Maze 期望DP 待定系数法 ★★
MazeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 2192 Accepted Submission(s): 890Special JudgeProblem DescriptionWhen wake原创 2015-12-22 14:45:24 · 522 阅读 · 0 评论 -
hdu 4939 Stupid Tower Defense dp
Stupid Tower DefenseTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1986 Accepted Submission(s): 545Problem DescriptionFSF原创 2015-11-18 08:18:07 · 455 阅读 · 0 评论 -
hdu 2955 Robberies 01背包 ★★☆
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17691 Accepted Submission(s): 6531Problem DescriptionThe aspiring Ro原创 2015-11-30 11:19:56 · 305 阅读 · 0 评论 -
hdu 2639 Bone Collector II 01背包 第k优解
Bone Collector IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3338 Accepted Submission(s): 1716Problem DescriptionThe titl原创 2015-12-01 23:16:18 · 308 阅读 · 0 评论 -
uva 11825 黑客的攻击 Hackers' Crackdown 集合dp+我的优化 非常好的好题
题目:点我题目大意:(黑客的攻击)假设你是一个黑客,侵入了了一个有着n台计算机(编号为0,1,…,n-1)的网络。一共有n种服务,每台计算机都运行着所有的服务。对于每台计算机,你都可以选择一项服务,终止这台计算机和所有与它相邻计算机的该项服务(如果其中一些服务已经停止,则这些服务继续处于停止状态)。你的目标是让尽量多的服务器完全瘫痪(即:没有任何计算机运行该项服务) 输入原创 2016-02-05 16:25:26 · 832 阅读 · 0 评论