Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

拓扑排序?

Posted by moretimes at 2013-01-10 23:18:08 on Problem 2762
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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator