最大子数组

最新推荐文章于 2021-08-27 09:50:30 发布

Wudongxu1

最新推荐文章于 2021-08-27 09:50:30 发布

阅读量134

点赞数 1

本文链接：https://blog.csdn.net/Wudongxu1/article/details/82384577

版权

#include "stdafx.h"
#include<iostream>
using namespace std;
int Maxsubarry(int *addre,int n)
{
    int ans = -100000;
    for (int i = 0; i < n; i++)
    {
        for (int j = i; j < n; j++)
        {
            int sum = 0;
            for (int k = i; k <= j; k++)
            {
                sum += addre[k];
            }
            if (sum>ans)
            {
                ans = sum;
            }
        }
    }
    return ans;
}
int main()
{
    int n;
    cin >> n;
    int *addre=new int(n);
    for (int i = 0; i < n; i++)
    {
        cin >> addre[i];
    }
    cout << Maxsubarry(addre, n) << endl;
    return 0;
}