数组连续子数组的和最大

int maxarry(vector<int> s)
{
vector<int> a(s.size(), 0);
a[0] = s[0];
int max = a[0];
for (int i = 1; i < s.size(); i++)
{
if (a[i - 1] <= 0)
{
a[i] = s[i];
}
else
{
a[i] = a[i-1] + s[i];
}
if (max < a[i])
max = a[i];
}
return max;
}

int main()
{
vector<int> ax = { 1, -2, 3, 10, -4, 7, 2, -5 };
cout << maxarry(ax) << endl;
return 0;
}