 |
| ||||
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 | |||||||||
Re:最简单的贪心法就能0msAC。。但是要注意坑In Reply To:Re:最简单的贪心法就能0msAC。。但是要注意坑 Posted by:wd22 at 2016-02-20 23:38:50 这道题可以理解为图着色问题吗？ 将每一次搬动定义为点，如果两次搬动有冲突，则用边连接这两个点（搬动）；最后转为图着色问题的最少颜色数×10。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
