 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
删除若干边形成一颗树，最终剩下N-1条边，其中三种颜色的个数分别为X、Y、Z； 显然X+Y+Z=N-1，求max( min(X,Y,Z) )。In Reply To:问一下，这题的意思是求最小生成树使得树中最少个数颜色的个数最大吗？ Posted by:wplxb at 2007-07-14 12:08:52 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
