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 |
Re:这题排序之后就可以确定子树的顺序,即使是1000叉In Reply To:这题排序之后就可以确定子树的顺序,即使是1000叉 Posted by:magic_pig at 2004-12-28 21:46:54 偶当时就是这样想D,可是求wi的dfs写错了-_!!唉 > 访问每一棵子树失败的代价设为wi,相应子树的叶子数目设为li > 对wi/li排序之后的顺序就是子树的访问顺序 > 当时比赛的时候忘了"工序问题",也没看到8叉,留下了郁闷.. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator