玄学错一个点，求调

666玄学错一个点，求调

#include <bits/stdc++.h>
#define int long long
using namespace std;
int n;
int a[114514], b[114514];
signed main(){
	cin >> n;
    int maxn = 0;
	for (int i = 0;i < n;++ i){
		cin >> a[i];
		b[i] = b[i - 1] + a[i];
		if (b[i] < 0){
			b[i] = 0;
		}
        maxn = max(maxn, b[i]);
	}
	cout << maxn;
	return 0;
}