摘要：
Find a path Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 930 Accepted Submission(s): 410 Prob 阅读全文
摘要：
XYZZY Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3608 Accepted Submission(s): 1018 Problem 阅读全文
摘要：
D. Tanya and Password time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output While dad was at w 阅读全文
摘要：
D. Tree Requests time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Tree Requests time l 阅读全文
摘要：
Problem 2140 Forever 0.5 Problem Description Given an integer N, your task is to judge whether there exist N points in the plane such that satisfy the 阅读全文
摘要：
连通分量 个数可以通过一次BFS或者DFS得到 割点和桥 可以枚举删除每一个点或者每一条边，判断连通分量个数是否增加 更好的方法 该算法是R.Tarjan发明的。对图深度优先搜索，定义DFS(u)为u在搜索树（以下简称为树）中被遍历到的次序号。定义Low(u)为u或u的子树中能通过非父子边追溯到的最 阅读全文