 |
| ||||
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:slp at 2010-10-09 22:51:14 > 不如给定一个可选范围是r行c列 > 那么我们可以每次枚举r行的和sub[] > 然后对sub求最大的c个连续子段和即可。可能数据太弱了 这样16ms水果 > 0ms估计是树状做的吧，再次学习... 我也是这样写的啊，可是不知哪里错了，怎么wa了 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
