Timus 1296. Hyperjump

原题：Hyperjump

题意：给出N个数，求连续区间最大值

解法：记录前缀和，若和小于0，则从新记录

#include <iostream>
using namespace std;

int sum, ans, x, n;
int main() {
    cin >> n;
    sum = 0;
    ans = 0;
    for (int i = 1; i <= n; i++) {
        cin >> x;
        sum += x;
        ans = sum>ans ? sum:ans;
        sum = sum>0 ? sum:0;
    }
    cout << ans << endl;
}