 |
| ||||
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:《挑战程序设计竞赛》这道题例程这个if是想干啥的？？In Reply To:Re:《挑战程序设计竞赛》这道题例程这个if是想干啥的？？ Posted by:Yi_iY at 2018-02-02 23:55:12 每次合并时N要减一，所以用L[mii1]来保存之前合并后的结果，用L[mii2]来保存去掉的最后一个元素L[N-1],为了防止最短的板正好是最后一个导致N-1后合并的木板就找不到了 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
