本文介绍了一个使用C++实现的最大子数组求和算法。该算法通过读取一系列整数并找出连续子数组中和最大的部分，同时记录下这个最大和及其开始和结束的位置。程序采用了动态规划的思想进行优化，使得其能在较大的数据规模下快速得出结果。
#include<iostream>
#include<algorithm>
using namespace std;
#define N 100010
int a[N];
int main()
{
int t;
cin >> t;
for (int i = 1; i <= t; i++)
{
int n, m = -1001,sum=0;
int s = 1, e = 1, te = 1;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sum += a[i];
if (sum > m)
{
m = sum;
e = i;
s = te;
}
if (sum < 0)
{
te= i + 1;
sum = 0;
}
}
cout << "Case " << i << ":" << endl;
cout << m << " " << s << " " << e<<endl;
if (i < t) cout << endl;
}
return 0;
}
#include<algorithm>
using namespace std;
#define N 100010
int a[N];
int main()
{
int t;
cin >> t;
for (int i = 1; i <= t; i++)
{
int n, m = -1001,sum=0;
int s = 1, e = 1, te = 1;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sum += a[i];
if (sum > m)
{
m = sum;
e = i;
s = te;
}
if (sum < 0)
{
te= i + 1;
sum = 0;
}
}
cout << "Case " << i << ":" << endl;
cout << m << " " << s << " " << e<<endl;
if (i < t) cout << endl;
}
return 0;
}
扫一扫
3071
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
