View Code of Problem 19

#include <iostream>
#include "vector"

using namespace std;

/**
 * kkmd66 四刷
 * @return
 */

int main() {

    int n;
    while (cin >> n && n != 0) {

        //存储该序列
        vector<int> vector(n);
        for (int i = 0; i < n; ++i) {
            cin >> vector[i];
        }

        //依次遍历序列，找加和最大子串
        long long max = vector[0];
        for (int i = 0; i < vector.size(); ++i) {
            //每个序列起始开始加和
            long long sum = 0;
            for (int j = i + 1; j < vector.size(); ++j) {
                sum += vector[j];
                if (sum > max)
                    max = sum;
            }
        }

        cout << max << endl;
    }

    return 0;
}