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

Re:想出个更简单的算法

Posted by trueshlqsh at 2008-03-05 12:27:54 on Problem 1230
In Reply To:想出个更简单的算法 Posted by:jesse_luzexi at 2008-01-15 21:40:31
I have tried ,but WA...
> 把所有点都用map[][]记录,墙为1,非墙为0
> 从左往右遍历,
> 如遇某列超出K了,假设超出M个
> 在该列上选取对后面影响最大的M条墙,去除后,
> 继续遍历.
> 去掉多少条墙,就是答案了。
> 够详细了吧。。。^_^

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