2019年5月2日
判环拓扑
摘要： bool dfs(int u) { vis[u] = 1; for (int i = head[u]; i; i = edge[i].next) { int v = edge[i].to; if (vis[v] == 1) return false; if (vis[v] == 0 && !dfs(v)) return false;... 阅读全文
posted @ 2019-05-02 21:19 WTSRUVF 阅读(156) 评论(0) 推荐(0)
Friends ZOJ - 3710（交集）
摘要： Alice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less than k friends in com 阅读全文
posted @ 2019-05-02 16:37 WTSRUVF 阅读(177) 评论(0) 推荐(0)