最大子数组和

---

源代码：

#include<iostream>
#include<vector>
using namespace std;


int sum(vector<int> arry, int n)
{
	int s = 0;
	for (int i = 0; i < n; i++)
	{
		s = s + arry[i];
	}
	return s;
}

int max(vector<int>arry, int n)
{
	int Max = arry[0];
	for (int i = 1; i < n; i++)
	{
		if (arry[i] > Max)
			Max = arry[i];
	}
	return Max;
}
int Values(vector<int> arry, int n)
{
	vector<int>value;
	for (int i = 1; i <= n; i++)
	{
		int count = n - i + 1;
		vector<int>value2;
		vector<int>value3;
		for (int j = 0; j <= n - i; j++)
		{
			for (int L = j; L <= j + i - 1; L++)
			{
				value3.push_back(arry[L]);
			}
			value2.push_back(sum(value3, i));
			for (int L = j; L <= j + i - 1; L++)
			{
				value3.pop_back();
			}
		}
		value.push_back(max(value2, count));
		for (int i = 0; i < count; i++)
			value2.pop_back();

	}
	return max(value, n);
}
int main()
{
	int n;
	cin >> n;
	int num;
	vector<int>arr(n);
	for (int i = 0; i < n; i++)
	{
		cin >> num;
		arr[i] = num;
	}
	int N = arr.size();
	cout << Values(arr, N) << endl;
	return 0;
}