摘要:
题目链接:https://www.nowcoder.com/acm/contest/145/A A、Minimum Cost Perfect Matching You have a complete bipartite graph where each part contains exactly n 阅读全文
摘要:
题目链接:https://www.nowcoder.com/acm/contest/144/J 标题:J、Heritage of skywalkert | 时间限制:1 秒 | 内存限制:256M skywalkert, the new legend of Beihang University AC 阅读全文