求最大子数组（结对开发）

//动态规划 
//2016/3/23
#include "iostream"
using namespace std;

#define N 100

typedef struct data
{
    int kaishi;
    int jieshu;
    int value;
}data;


int main()
{
    int  num = 0;
    int A[N];
    cout << "任意输入一个数组：";
    while (true)
    {
        cin >> A[num];
        num++;
        if (getchar() == ‘\n‘)
        {
            break;
        }
    }
    data Start;
    data All;
    //初始化
    Start.kaishi = All.kaishi = 0;
    Start.jieshu = All.jieshu = 0;
    Start.value = All.value = A[0];

    //动态规划，求出最小子数组的和以及最小子数组开始和结束的位置
    for (int i = 1; i < num; i++)  //从前向后遍历
    {
        if (A[i] > Start.value + A[i])
        {
            Start.value = A[i];
            Start.kaishi = i;
            Start.jieshu = i;
        }
        else
        {
            Start.value += A[i];
            Start.jieshu = i;
        }
        if (Start.value > All.value)
        {
            All = Start;
        }
    }
    

    cout << "和最大的最小子数组为：" << endl << "从第" << All.kaishi + 1 << "个数开始，第" << All.jieshu+ 1 << "个数结束" << endl << "和为：" << All.value << endl;//输出
    return 0;


}