CodeForces 1556C :Compressed Bracket Sequences 思维

传送门

题意

给你序列表示左右括号的数量，求合法区间$[l,r]$的数量

分析

暴力枚举右端点，向左扫描，维护最大右括号数量和最小右括号数量，匹配即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
ll a[N];
int n;

int main() {
	int n;
	read(n);
	for(int i = 1;i <= n;i++) read(a[i]);
	if(n & 1) n--;
	ll ans = 0;
	for(int i = 2;i <= n;i += 2){
		ll sum = 0,res = -a[i];
		for(int j = i - 1;~j;j -= 2){
			sum += a[j + 1];
			res += a[j + 1];
			if(a[j] > sum){
				ans += sum - res;
				if(res) ans++;
				break;
			}
			if(a[j] >= res){
				ans += a[j] - res;
				if(res) ans++;
			}
			res -= min(a[j],res);
			sum -= a[j];

		}
	}
	dl(ans);
	return 0;
}