rt，样例对了；

#include <iostream>
#include <cmath>
#include <string>
#include <cstring>
#include <iomanip>
#include <algorithm>
#include <chrono>
#include <vector>
#include <ctime>
#include <map>
#include <cstdlib>
#include <set>
#include <queue>//队列
#include <stack>//栈 
using namespace std;
int main()
{
	int n;
	cin >> n;
	long long ans = 0;
	long long cnt = 0;
	for (int i = 1; i <= n; i++)
	{
		int a;
		cin >> a;
		if (a < 0)
		{
			ans += -a;
		}
		else
		{
			cnt = max(cnt, ans);
			ans = 0;
		}
	}
	cnt = max(cnt, ans);
	ans = 0;
	cout << cnt + 1;
}

验证码TGY8