摘要: 题面:https://www.luogu.org/problem/P2966 cpp 本题直接在floyd的基础上加上最大点权即可.(先排序,保证点权最小) Code: include include include include include include include include u 阅读全文
posted @ 2019-10-17 20:57 prestige 阅读(93) 评论(0) 推荐(0) 编辑
摘要: 题面:https://www.luogu.org/problem/P2532 阅读全文
posted @ 2019-10-17 12:57 prestige 阅读(132) 评论(0) 推荐(0) 编辑