![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
分数规划
sigh_
这个作者很懒,什么都没留下…
展开
-
洛谷_1642 规划(分数规划+动态规划)
规划题目链接:https://www.luogu.com.cn/problem/P1642题解:分数规划,设d[i]=a[i]−mid∗b[i]d[i] = a[i]-mid*b[i]d[i]=a[i]−mid∗b[i].check:动态规划,求是否存在m个点连通块d[i]d[i]d[i]。dp[u][i]dp[u][i]dp[u][i]代表以uuu为根节点的子树,选iii个节点能得到的最大的d[i]d[i]d[i]和。递推方程dp[u][j+k]=max(dp[u][j+k],dp[u][j]+原创 2020-06-21 09:32:16 · 237 阅读 · 0 评论 -
HDU_6240 Server(分数规划+树状数组)
ServerTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionAlice and Bob are working on a new assignment. In this project, they need to access ...原创 2020-04-26 23:40:56 · 172 阅读 · 0 评论