Tarjan
小伙子开的什么车啊
这个作者很懒,什么都没留下…
展开
-
POJ3160-Father Christmas flymouse (强连通缩点+dfs)
Father Christmas flymouse Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 3764 Accepted: 1245 DescriptionAfter retirement as contestant from WHU ACM Team, flymouse volunteere原创 2018-01-18 20:54:47 · 252 阅读 · 0 评论 -
HDU2767-Proving Equivalences(强连通+缩点+DGA性质)--Tarjan模板
Consider the following exercise, found in a generic linear algebra textbook. Let A be an n × n matrix. Prove that the following statements are equivalent: A is invertible. Ax = b has exactly one原创 2018-01-18 20:44:03 · 224 阅读 · 0 评论 -
Codeforces Round #460 (Div. 2)-D Substring(Tarjian+记忆化搜索)
D. Substring You are given a graph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example,原创 2018-02-01 10:18:32 · 204 阅读 · 0 评论