| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
拓扑排序?int G (int x, int c)
{
for the first i belong to E[x]
return G (i, c + 1);
return c;
}
if (G (t, 1) == scc_cnt)
cout << "Yes" << endl;
else
cout << "No" << endl;
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator