| ||||||||||
| 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:有一个比较难的问题,想请大家帮忙!In Reply To:Re:有一个比较难的问题,想请大家帮忙! Posted by:frkstyc at 2006-10-27 21:17:34 > 你还是把问题用符号描述下吧,文字说有太多含糊的地方 > 在图G中,把这样的聚集C找出来,要求|C| <= k,且 C 不包含这样的两个结点, comm(a,b) >= 1/4 maxComm,comm(a,b)是C中任意两个结点之间的距离,maxComm是图中两个最远结点之间的距离。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator