最大子数组2

 1 #include<iostream>
 2 using namespace std;
 3 
 4 void main()
 5 {
 6     int a[100] = { 0 };
 7     int b[10][100] = { 0 };
 8     int length, i, j, all = 0;
 9     int begin = 0, end = 0;        //数组的起始和终止下标
10     int max, temp;
11     cout << "输入随机整数:" << endl;
12     
13     for (length = 0;;)
14     {
15         cin >> a[length];
16         length++;
17         if (getchar() == ‘\n‘)    //回车结束
18         {
19             break;
20         }
21     }
22                                   //求子数组
23     for (i = 0; i<length; i++)
24     {
25         temp = i;
26         all = 0;
27         j = 0;
28         while (j <= length - 1)
29         {
30             all += a[temp];
31             b[i][j] = all;
32             temp++;
33             if (temp>length - 1)
34             {
35                 temp = 0;
36             }
37             j++;
38         }
39     }
40     max = b[0][0];
41     for (i = 0; i<length; i++)//将每个数对应的最大子数组进行判断，最后得到整个整数组的最大子数组
42     {
43         for (j = 0; j<length; j++)
44         {
45             if (b[i][j]>max)
46             {
47                 max = b[i][j];
48                 begin = i;
49                 end = j;
50             }
51         }
52     }
53     cout << "最大子数组的值为：" << max << endl;
54     cout << "最大子数组中元素的下标位置：" << endl;
55     i = 0;
56     while (i <= end)          //输出下标值
57     {
58         cout << begin << "  ";
59         begin++;
60         if (begin >= length)
61         {
62             begin = 0;
63         }
64         i++;
65     }
66     cout << endl;
67 }