摘要: Sparse Graph Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Problem Description In graph theory, the complement of 阅读全文
posted @ 2016-09-26 20:59 jhz033 阅读(276) 评论(0) 推荐(0) 编辑
摘要: Weak Pair Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Problem Description You are given a rooted tree of N node 阅读全文
posted @ 2016-09-26 19:10 jhz033 阅读(452) 评论(0) 推荐(0) 编辑