----动态规划
文章平均质量分 84
chenchenT_
这个作者很懒,什么都没留下…
展开
-
------区间DP hdu 5115 - Dire Wolf
Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor. Dire wolves look like normal wolves, but these c原创 2017-06-27 19:25:45 · 365 阅读 · 0 评论 -
-----背包 DP hdu 5119- Happy Matt Friends
Matt has N friends. They are playing a game together. Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his friends. If the xor (exclusive-or) sum of the sele原创 2017-06-27 19:42:27 · 338 阅读 · 0 评论 -
-----概率DP ZOJ 3822- Domination
Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. What’s more, he bought a large decorative chessboard with N rows and M columns.Ever原创 2017-07-15 21:11:04 · 354 阅读 · 0 评论 -
-----hdu 5000 Clone 猜想+背包
After eating food from Chernobyl, DRD got a super power: he could clone himself right now! He used this power for several times. He found out that this power was not as perfect as he wanted. For exampl原创 2017-09-10 23:53:56 · 295 阅读 · 0 评论 -
-----区间DP 石子的合并
石子合并时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 有N堆石子排成一排,每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆,每次合并花费的代价为这两堆石子的和,经过N-1次合并后成为一堆。求出总的代价最小值。 输入 有多组测试数据,输入到文件结束。 每组测试数据第一行有一个整数n,表示有n堆石子。 接下来原创 2017-05-31 19:44:59 · 402 阅读 · 0 评论 -
-----hdu 4815 -01背包- Little Tiger vs. Deep Monkey
A crowd of little animals is visiting a mysterious laboratory – The Deep Lab of SYSU. “Are you surprised by the STS (speech to speech) technology of Microsoft Research and the cat face recognition proj原创 2017-11-16 20:17:49 · 415 阅读 · 0 评论