 |
| ||||
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:想出个更简单的算法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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
