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 |
一次AC,happy! 16ms每次读取一行,就进行一次拓扑排序 判断拓扑排序的结果是否可以唯一有序或者得到矛盾的环 如果读完所有的数据还不能满足以上两种情况,输出结果不确定。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator