Codeforces Round #668 (Div. 2) B. Array Cancellation（思维）

加一些小小的优化，可以解决Time limit exceeded

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;
 
#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
#define   mem(x,v)      memset(x,v,sizeof(x))
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}
 
int t, n;
LL a[100005];

void assignOut()
{
	LL ans = 0;
	for(int i = 1; i <= n; i++)
		if(a[i] > 0)
			ans += a[i];
	cout<<ans<<endl; 
	return ;
}

int main()
{
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin>>t;
	while(t--){
		cin>>n;
		for(int i = 1; i <= n; i++)
			cin>>a[i];
		int st = 1, en = 1;
		for(;;){
			while(a[st] <= 0 && st <= n)
				st++;
			if(en < st) //一个小优化，解决了Time limit exceeded 
				en = st;
			while(a[en] >= 0 && en <= n)
				en++;
			if(st > n || en > n){
				assignOut();
				break;
			}
			LL tmp = a[st] + a[en];
			if(tmp > 0)
				a[st] = tmp,
				a[en] = 0;
			else if(tmp < 0)
				a[st] = 0,
				a[en] = tmp;
			else
				a[st] = 0,
				a[en] = 0;
		}
	}
	
	return 0;
}