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

//动态规划 
//2016/3/26
#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 = 0; i < num; i++)
    {
        Start.value = 0;
        Start.kaishi = i;
        for (int j = i; j < num; j++)
        {
            Start.value += A[j];
            Start.jieshu = j;
            if (Start.value>All.value)
                All = Start;
        }
        for (int j = 0; j < i; j++)
        {
            Start.value += A[j];
            Start.jieshu = j;
            if (Start.value>All.value)
                All = Start;
        }
    }
    //输出
    cout <<"开始位置："<<All.kaishi+1<<endl<<"结束位置："<<All.jieshu+1<<endl<<"最后和为："<< All.value<<endl;

    return 0;

}