蓝桥杯 I: 翻转括号序列（满分做法）

本质上是线段树加二分
最近忙着考试，等有时间再来详细写写做法。
不知道在哪里提交，反正我大数据对拍了5分钟都是通过的，小数据也对拍了很久。

#include <iostream>
#include <cstring>
#include <algorithm>
#include <ctime>
#include <vector>
#include <set>
#include <map>


using namespace std;
#define x first 
#define y second 

typedef long long LL;
typedef pair <int, int> PII;

const int N = 1e6 + 10, INF = 1e9, mod = 1e9 + 7;

int a[N], n, m;


struct Node
{
	int lmin, lmax, one, unone, sum;
	bool flag = false;
} tr[N * 4];


void pushup (Node &a, Node b, Node c)
{
	a.lmin = min (b.lmin, b.sum + c.lmin);
	a.lmax = max (b.lmax, b.sum + c.lmax);
	a.sum = b.sum + c.sum;
	a.one = b.one + c.one;
	a.unone = b.unone + c.unone;
}
void pushup (int u)
{
	pushup (tr[u], tr[u << 1], tr[u << 1 | 1]);
}

void pushdown (int u)
{
	if (tr[u].flag) 
	{
		tr[u << 1].flag ^= 1, tr[u << 1 | 1].flag ^= 1;
		swap (tr[u << 1].lmax, tr[u << 1].lmin);
		tr[u << 1].lmax = -tr[u << 1].lmax, tr[u << 1].lmin = -tr[u << 1].lmin;
		swap (tr[u << 1 | 1].lmax, tr[u << 1 | 1].lmin);
		tr[u << 1 | 1].lmax = -tr[u << 1 | 1].lmax, tr[u << 1 | 1].lmin = -tr[u << 1 | 1].lmin;
		swap (tr[u << 1].one, tr[u << 1].unone);
		swap(tr[u << 1 | 1].unone, tr[u << 1 | 1].one);
		tr[u << 1].sum = tr[u << 1].one - tr[u << 1].unone;
		tr[u << 1 | 1].sum = tr[u << 1 | 1].one - tr[u << 1 | 1].unone; 
	}
	tr[u].flag = false;

}

void build (int u, int l, int r)
{
	if (l == r) 
	{
		tr[u] = {min (0, a[l]), max (0, a[l]), a[l] == 1 ? 1 : 0, a[l] == -1 ? 1 : 0, a[l], false};
	}
	else 
	{
		int mid = l + r >> 1;	
		build (u << 1, l, mid), build (u << 1 | 1, mid + 1, r);
		pushup (u);
	}
}

Node query (int u, int l, int r, int x, int y)
{
	
	if (x > y || l > y || r < x) return Node {0, 0, 0, 0, 0, 0};
	if (l >= x && r <= y) 
	{

	//	cout << u << ' ' << r << ' ' << tr[8].lmin << endl;
		return tr[u];
	}
	else 
	{
		pushdown (u);
		int mid = l + r >> 1;
		Node t = {0};
		pushup (t, query (u << 1, l, mid, x, y), query (u << 1 | 1, mid + 1, r, x, y));
		return t;
	}
}

void modify (int u, int l, int r, int x, int y)
{
	if (l > y || r < x) return;
	if (l >= x && r <= y) 
	{
		tr[u].flag ^= 1;
		swap (tr[u].lmax, tr[u].lmin);
		tr[u].lmax = -tr[u].lmax, tr[u].lmin = -tr[u].lmin;
		swap (tr[u].one, tr[u].unone);
		tr[u].sum = tr[u].one - tr[u].unone;
	}
	else 
	{
		pushdown (u);
		int mid = l + r >> 1;
		modify (u << 1, l, mid, x, y), modify (u << 1 | 1, mid + 1, r, x, y);
		pushup(u);
	}
}


int get (int pos)
{
	//cout << "SSS" << endl;
	int l = pos, r = n;
	while (l < r)
	{
		int mid = l + r + 1 >> 1;
		if (query (1, 1, n, pos, mid).lmin >= 0) l = mid;
		else r = mid - 1;
	}
	
	int le = pos, ri = l;
	while (le < ri)
	{
		int mid = le + ri + 1 >> 1;
		Node t1 = query (1, 1, n, pos, mid);
		Node t2 = query (1, 1, n, mid + 1, l);
		if (t1.sum == 0 || t1.sum + t2.lmin == 0) le = mid;
		else ri = mid - 1;
	}
	if (le == pos) return 0;
	return le;
}

int main()
{
	clock_t c1 = clock();
	ios::sync_with_stdio(false);
	cin.tie(0);
#ifdef LOCAL
	freopen("in.in", "r", stdin);
	freopen("out.out", "w", stdout);
#endif
	// ------------------------------------------------------------------------------------------------>
		cin >> n >> m;
		string str; cin >> str;
		for (int i = 0; i < str.size(); i ++) 
		{
			a[i + 1] = -1;
			if (str[i] == '(') a[i + 1] = 1;
		}
		build (1, 1, n);
		
		while (m --)
		{
			int op; cin >> op;
			if (op == 1)
			{
				int l, r; cin >> l >> r;
				modify (1, 1, n, l, r);				
			}
			else 
			{
				int x; cin >> x;
				cout << get (x) << '\n';
			}
		}
	// ------------------------------------------------------------------------------------------------>
end:
	cerr << "Time Use  -----> " << clock() - c1 << "ms" << endl;
	return 0;// 
}