1 //返回整数数组最大子数组和2
 2 //孔宇航 赵子茵 2016/3/25
 3 
 4 #include <iostream>
 5 using namespace std;
 6 #define N 1000
 7 
 8 int value(int arry[], int length)
 9 {
10     int max[N], max1;
11     int maxweizhi[N];
12     for (int j = 0; j<(length + 1) / 2; j++)
13     {
14         int sum = 0;
15         max1 = -9999999;                   //设置最低范围
16         int z = 0;
17         for (int i = j; i<(length + 1) / 2 + j; i++)   //环形数组找最大子数组和
18         {
19             sum = sum + arry[i];
20             if (sum >= max1)
21             {
22                 max1 = sum;
23                 z++;
24             }
25         }
26         max[j] = max1;
27         maxweizhi[j] = z;
28 
29     }
30     int fmax = max[0];
31     int q = 0;
32     for (int i = 0; i<(length + 1 / 2); i++)  //在所有和的数组中找最大值
33     {
34         if (max[i]>fmax)
35         {
36             fmax = max[i];
37             q = i;
38         }
39     }
40 
41     int weizhi = maxweizhi[q];
42 
43     cout << "最大子数组为：" << endl;
44     for (int num = q; num<q + weizhi; num++)  //输出最大子数组的位置
45     {
46         cout << arry[num] << " ";
47     }
48 
49     cout << "其和为:  " << fmax << endl;
50     return 0;
51 }
52 
53 void main(int argc, char* argv[])
54 {
55     int arry[N];
56     int length = 1;
57     int max[N], max1; //max[N]存每一次求和的结果，在其中找最大值，为所求
58     int maxweizhi[N];
59     int num = 0;
60     int value(int arry[], int length);
61     cout << "请输入数组：" << endl;
62     cin >> arry[0];
63     while (getchar() != ‘\n‘)      //输入数组
64     {
65         cin >> arry[length];
66         length++;
67     }
68 
69     for (int j = length; j<2 * length - 1; j++)   //形成环形数组，首位相连
70     {
71         arry[j] = arry[num];
72         num++;
73     }
74 
75     cout << "由这几个数形成的环形数组";
76     value(arry, 2 * length - 1);
77 
78 }