2018年5月10日
ICPC2017 Naning - The Maximum Unreachable Node Set
摘要： 标签： 最大独立集 最小路径覆盖 题目描述 In this problem, we would like to talk about unreachable sets of a directed acyclic graph G = (V, E). In mathematics a directed 阅读全文
posted @ 2018-05-10 21:25 sciorz 阅读(144) 评论(0) 推荐(0) 编辑