整数数组中最大子数组求和02

 1 #include<iostream>
 2 #include <algorithm>
 3 using namespace std;
 4 
 5 int main()
 6 {
 7     int a[100];
 8     int NUM = 0;
 9     int MAXSUM = 0;
10     int SUM = 0;
11     for (; NUM<100; NUM++)
12     {
13         cin >> a[NUM];
14         if (getchar() == ‘\n‘)
15         {
16             break;
17         }
18     }
19     if (NUM == 100)
20     {
21         NUM = 99;
22     }
23     for (int i = 0; i <= NUM; i++)
24     {
25         SUM = max(SUM+a[i], a[i]);
26         MAXSUM = max(SUM, MAXSUM);
27     }
28     cout <<"最大和："<< MAXSUM << endl;
29     return 0;
30 }