牛客网多校训练第二场D Kth Minimum Clique
摘要：
链接：https://ac.nowcoder.com/acm/contest/882/D来源：牛客网 Given a vertex-weighted graph with N vertices, find out the K-th minimum weighted clique. A subset 阅读全文
posted @ 2019-07-21 17:39 CUPXSR 阅读(163) 评论(0) 推荐(0) 编辑
