Detail of message

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

请问，怎么找出最少的子集来组成一个全集啊。

Posted by ImLazy at 2005-09-01 11:22:39

就是有一个全集，给你很多它的子集，要求你找出的子集子个数最少，用它们来组成这个全集。
用怎样的算法呢？请教。

Followed by:

用二进制吧？ (61) sunmoonstar_love 2005-09-01 14:02:01
- 我想可能是用树形穷举+剪枝吧。 (0) ImLazy 2005-09-01 16:49:05
  - np? (0) sunmoonstar_love 2005-09-01 16:52:35
  - 组成全集的子集可以有交集么？ (0) sunmoonstar_love 2005-09-01 16:55:27

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator