建议关注

(summaxsum){maxsumsum;startp;endj;}if

(sum0){//扫描到j时若前面的最大子序和是负数从下一个重新开始求和sum0;pj1;}}printf(Case

%d:\n,i);printf(

dp[100005];//dp[i]:以第i个数为结尾的最大值

int

(dp[i-1]dp[i]dp[i])//转移方程dp[i]max(dp[i-1]a[i],a[i])dp[i]dp[i-1]dp[i];//dp[i-1]a[i]比a[i]大else

(dp[i]maxsum){//dp[i]更大maxsumdp[i];startp;endi;//p开始i结尾}}printf(Case

%d:\n,k);printf(

{while(!dq.empty()dq.front()i-m)

(dq.empty())

max(ans,s[i]-s[dq.front()]);//队头就是最小的s[k]while(!dq.empty()s[dq.back()]s[i])

dq.pop_back();//队尾大于s[i]:去尾dq.push_back(i);}printf(%d\n,ans);return