注意:在实际问题中可能题目要求至少选一个,可能可以一个都不选
只返回最大子段和
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 2e5 + 10;
const int inf = 0x7fffffff;
int n;
int a[maxn];
int maxsum(){
int cur = 0,res = -inf;
for(int i = 0; i < n; i++){
cur = max(cur + a[i], a[i]);
if(cur > res) res = cur;
}
return res;
}
int main()
{
cin>>n;
for(int i = 0; i < n; i++){
cin>>a[i];
}
cout<<maxsum()<<endl; //如果返回值小于0,可以置零表示一个都不选
return 0;
}
返回结果并返回左右端点位置
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 2e5 + 10;
const int inf = 0x7fffffff;
int n;
int a[maxn];
int maxsum(int &start,int &ed){
int cur = 0, res = -inf;
int temp = 1;
for(int i = 1; i <= n; i++){
cur += a[i];
if(cur > res){
res = cur;
start = temp;
ed = i;
}
if(cur < 0){
cur = 0;
temp = i + 1;
}
}
return res;
}
int main()
{
cin>>n;
for(int i = 1; i <= n; i++){
cin>>a[i];
}
int s,t;
cout<<maxsum(s,t)<<endl; //if返回值小于0,可以一个都不选,则置为0
cout<<s<<' '<<t<<endl;
return 0;
}