2019年7月22日
2019牛客多校第二场 Kth Minimum Clique
摘要： 题目描述 Given a vertex-weighted graph with N vertices, find out the K-th minimum weighted clique. A subset of vertices of an undirected graph is called c 阅读全文
posted @ 2019-07-22 11:42 Kissheart_LMC 阅读(253) 评论(0) 推荐(0)