【浙大版数据结构】【C++版】【2】——Maximum Subsequence Sum

最新推荐文章于 2024-10-01 23:10:03 发布

在下_诸葛

最新推荐文章于 2024-10-01 23:10:03 发布

阅读量105

点赞数 1

文章标签：数据结构 c++

本文链接：https://blog.csdn.net/m0_56342660/article/details/118873825

版权

题目：

也可点这里，有PTA账号就可

C++代码：

#include <iostream>
using namespace std;
int main()
{
    int a[100000];
    int index_flag = -1, index_0 = 0, index_1 = 0;
    int i, j, num, max = 0, sum = 0;
    cin >> num;
    for (i = 0; i < num; i++)
    {
        cin >> a[i];
        if (a[i] == 0)
        {
            index_flag = i;
        }
    }
    for (i = 0; i < num; i++)
    {
        sum = 0;
        for (j = i; j < num; j++)
        {
            sum += a[j];
            if (sum > max)
            {
                index_0 = i;
                index_1 = j;
                max = sum;
            }
        }
    }
    if (max == 0)
    {
        if (index_flag >= 0)
        {
            a[index_0] = 0;
            a[index_1] = 0;
        }
        else
        {
            index_0 = 0;
            index_1 = num - 1;
        }
    }
    cout << max << " " << a[index_0] << " " << a[index_1] << endl;
    return 0;
}