0001 int gs_IC(int A[], int n) { //递增版：O(n^2)
0002    int gs = 0; //目前已知的最大和
0003    for (int lo = 0; lo < n; lo++) //枚举区间
0004       for (int s = 0, hi = lo; hi < n; ) {
0005          s += A[hi++]; //递增地求和：O(1)
0006          gs = max(gs, s); //择优更新
0007       } //for
0008    return gs;
0009 } //gs_IC