Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Problem B: Box Relations

Posted by ACRush at 2009-11-01 09:16:39
In Reply To:武汉赛区比赛9:00-14:00，清华校内PK最终决战 Posted by:ACRush at 2009-11-01 08:59:48 
给定n个3维Box的相交或者不相交关系的信息，要求构造一组方案或输出无解

算法：拆分约束

所有的性质都是可以用A[i]<B[i]+C表示的，这样可以建一张有向图，然后用Bell-man-ford来计算。时间复杂度O(k*n*R)
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

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