数组结对

//郭婷 信1305 20132916 2015/3/20
#include<iostream>
#include<time.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
int maxsum(int a[], int n)
{
    int i;
    int maxsofar = 0;  //maxsofar记录到目前为止的的最大值
    int maxendinghere = 0; //maxendinghere记录从当前位置开始往前几个连续的数的和的最大值
    for (i = 0; i < n; i++)
    {
        maxendinghere = max(maxendinghere + a[i], 0);
        maxsofar = max(maxsofar, maxendinghere);
    }
    return maxsofar;
}
int main()
{
    int n, i;
    cout << "输入数组的个数:";
    cin >> n;
    int *a;
    a = new int[n];
    if (a == NULL )
    {
        cout << "Error: memory could not be allocated";
        return 1;
    }
    //srand((unsigned)time(NULL));
    for (i = 0; i < n; i++)
        cin >> a[i];
    /*for (i = 0; i < n; i++)
    {
        a[i] = rand() % 200 - 100;
        cout << a[i] << " " ;
    }*/
    cout << endl;
    int max=maxsum(a, n);
    cout << "最大子数组的和为：" << max << endl;
    delete[]a;
    return 0;
}