摘要: HDU-1024 Max Sum Plus Plus 问题描述 m段最大子段和 给一串数$S1,S2,...,Sx,...,Sn(1<=x<=n<=1000000,-32768<=S_x<=32767)$ 定义$sum(i,j)=S_i+\dots+S_j(1<=i<=j<=n)$ 给一个$m(m> 阅读全文
posted @ 2021-01-14 13:52 Mo_hw 阅读(130) 评论(0) 推荐(0) 编辑