#include<iostream>
using namespace std;
void Max(double a[], int n);
int main()
{
double a[20] = { 0 };
int i, n;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
Max(a, n);
return 0;
}
void Max(double a[], int n)
{
int i, j;
double sum = 0;
double max = 0;
for (i = 0; i < n; i++)
{
sum = 0;
if (a[i] < 0)
continue;
for (j = i; j < n; j++)
{
sum += a[j];
if (sum > max)
max = sum;
if (sum < 0)
sum = 0;
}
}
cout << max << endl;
}
最大子序列数,只测试了几组数据,求大佬指点
最新推荐文章于 2024-02-13 12:06:28 发布