强连通分量
文章平均质量分 83
a451907
这个作者很懒,什么都没留下…
展开
-
poj1236-network of schools(强连通分量)
Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8137 Accepted: 3221 Description A number of schools are connected to a computer network. A原创 2013-01-26 09:56:56 · 360 阅读 · 0 评论 -
poj2186Popular Cows
牛群里的牛相互崇拜,这种崇拜是单向可传递的,要求最受崇拜的牛有几个,最受崇拜的牛是受其余所有牛的崇拜 用tarjan算法 完全抄袭的模板,写出来了还是各种转不出来 #include #include #include #include using namespace std; int n,m; vector vec[100005]; int vis[100005]; int原创 2013-01-25 10:10:52 · 265 阅读 · 0 评论 -
hdu 2767 Proving Equivalences(强连通分量)
Proving Equivalences Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1426 Accepted Submission(s): 535 Problem Description Consider t原创 2013-01-26 11:15:04 · 454 阅读 · 0 评论 -
poj2553-The Bottom of a Graph(强连通分量)
The Bottom of a Graph Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 7098 Accepted: 2905 Description We will use the following (standard) definitions from g原创 2013-01-26 19:17:00 · 1250 阅读 · 1 评论 -
poj3114 Countries in War(强连通分量+最短路)
Countries in War Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1757 Accepted: 553 Description In the year 2050, after different attempts of the UN to mai原创 2013-01-28 20:49:48 · 1161 阅读 · 0 评论