AcWing 1479. 最大子序列和
原题链接
中等
作者:
_如鲸向海
,
2022-06-26 16:57:59
,
所有人可见
,
阅读 259
C++ 代码(甲级01day)
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 10010;
int a[N],dp[N];
int start[N];
int main(){
start[0] = 1;//边界处理
int number;
int res = -2e9;
cin>>number;
int end = 0;//记录结束位置
int flag = 0;
for(int i = 1;i<=number;i++){
cin>>a[i];
if(a[i]>=0) flag = 1;
}
for(int i = 1;i<=number;i++)
{
if(a[i]>dp[i-1]+a[i])
start[i] = i;
else
start[i] = start[i-1];
dp[i] = max(dp[i-1]+a[i],a[i]);
if(res<dp[i]) end = i;
res = max(res,dp[i]);
}
if(!flag){
res = 0;
cout<<res<<" "<<a[1]<<" "<<a[number]<<endl;
}
else
cout<<res<<" "<<a[start[end]]<<" "<<a[end]<<endl;
return 0;
}