dp
文章平均质量分 81
destiny546
这个作者很懒,什么都没留下…
展开
-
hdu5653 Bomber Man wants to bomb an Array(dp)
给一个长度为 NNN 的一维格子和一些炸弹的位置,请你计算 “最大总破坏指数”。每个炸弹都有向左和向右的破坏力,如果一个炸弹向左和向右的破坏力分别为 LLL 和 RRR,那么该炸弹将炸毁 L+R+1L + R + 1L+R+1 个格子(左边LLL个,炸弹所在格子,右边RRR个)。破坏指数的计算方式为:所有炸弹炸毁的格子数的乘积。假设第 iii 个炸弹炸毁了 XiX_iXi个格子,那原创 2016-03-28 21:28:13 · 246 阅读 · 0 评论 -
Codeforces Round #369 (Div. 2) C. Coloring Trees
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park wheren trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with integers原创 2016-08-30 13:36:44 · 327 阅读 · 0 评论 -
hdu 5800 计数dp
To My GirlfriendTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 929 Accepted Submission(s): 359Problem DescriptionDear GuoI n原创 2016-08-08 22:58:55 · 260 阅读 · 0 评论 -
全新的动态规划入门——从维度谈起
转载请注明出处:http://www.cnblogs.com/WABoss/p/DP.html 动态规划(Dynamic Programming, DP)是运筹学的一个分支,是求解决策过程(decision process)最优化的数学方法……(先忘了这个吧)允许我从另一个角度去理解并解释动态规划,那么开始吧。 一、维度首先说明维度(Dimension)这个转载 2016-08-10 09:29:07 · 1077 阅读 · 0 评论 -
hdu 5900 QSC and Master 区间dp
Every school has some legends, Northeastern University is the same.Enter from the north gate of Northeastern University,You are facing the main building of Northeastern University.Ninety-nine perc原创 2016-09-18 18:10:51 · 279 阅读 · 0 评论 -
hdu 6006 Engineer Assignment(状压)
题目:here主要思路:离散化之后进行状压dp#include #include #include #include using namespace std;typedef long long ll;const int maxn=1e5+5;int engi[15][5];int pro[15][5];int dp[15][1200];int v原创 2017-04-22 22:11:07 · 861 阅读 · 1 评论