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 |
请问这样的思路错在那里?因为染色的节点是要求父亲节点染完后才能染子节点的,所以我认为最后染色的节点一定是树的终端节点之一,找出所有的终端节点放入数组closed中,并用它们的coloring cost factor 乘以n,找出最小的值,然后把剩下的节点看成一棵树,再找出它的所有终端节点,拿它们的coloring cost factor乘以n-1 ......直到只有根节点。 但是我提交后却是错的!郁闷 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator