sigh_的博客

规划 题目链接：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]+

Server Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Problem Description Alice and Bob are working on a new assignment. In this project, they need to access ...