数组问题之求最大子数组问题（一）

 1 #include<iostream>
 2 using namespace std;
 3 
 4 int main()
 5 {
 6     int i,num;
 7     cout << "请输入数组元素个数： " ;
 8     cin >> num;
 9     int *arr = new int[num];
10     cout << "请依次输入数组元素" << endl;
11     for (i = 0; i < num; i++)
12     {
13         cin >> arr[i];
14     }
15     int MaxSum = 0;
16     int CurSum = 0;
17     for (i = 0; i<num; i++)
18     {
19         CurSum += arr[i];
20         if (CurSum > MaxSum)
21         {
22             MaxSum = CurSum;
23         }
24         if (CurSum < 0)
25         {
26             CurSum = 0;
27         }
28     }
29     cout <<"该数组中最大子数组的和是： "<< CurSum<<endl;
30     system("pause");
31 
32     return 0;
33 }