![](https://img-blog.csdnimg.cn/2019091813595558.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
状压dp
文章平均质量分 90
状压dp
_sky123_
这个作者很懒,什么都没留下…
展开
-
The 2021 ICPC Asia Regionals Online Contest (II) K.Meal
Meal (300分) Time for meals has passed. The restaurant in TTT University has only nnn dishes remained, and each dish can only serve one hungry student. nnn hungry students line up to get dishes, and everyone has their own preferences for each dish. For the原创 2021-09-28 22:33:31 · 238 阅读 · 0 评论 -
Educational Codeforces Round 86 (Rated for Div. 2) F. Make It Ascending
题目链接 You are given an array aaa consisting of nnn elements. You may apply several operations (possibly zero) to it. During each operation, you choose two indices iii and jjj (1≤i,j≤n1 \le i, j \le n1≤i,j≤n; i≠ji \ne ji=j), increase aja_jaj by aia_iai,原创 2021-02-24 21:22:54 · 180 阅读 · 0 评论 -
P3264 [JLOI2015]管道连接
题目链接 题目描述 小铭铭最近进入了某情报部门,该部门正在被如何建立安全的通道连接困扰。该部门有 nnn 个情报站,用 111 到 nnn 的整数编号。给出 mmm 对情报站 ui,viu_i,v_iui,vi 和费用 wiw_iwi,表示情报站 uiu_iui 和 viv_ivi 之间可以花费 wiw_iwi 单位资源建立通道。 如果一个情报站经过若干个建立好的通道可以到达另外一个情报站,那么这两个情报站就建立了通道连接。形式化地,若 uiuiui 和 vivivi 建立了通道,那么它们建立了原创 2020-10-06 22:25:55 · 222 阅读 · 0 评论