P1878 舞蹈课(二叉堆)

P1878 舞蹈课https://www.luogu.com.cn/problem/P1878

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)

int n;
bool vis[MAXN];
struct node {
	int x, y, z;
	node(int x1, int y1, int z1): x(x1), y(y1), z(z1) {
	}
	friend bool operator <(const node &a, const node &b)  {
		if (a.z == b.z) {
			return a.x > b.x;
		}
		return a.z > b.z;
	}
};
int a[MAXN];
typedef pair<int, int> P;
P ans[MAXN];
char s[MAXN];

int main() {
	priority_queue<node, vector<node> > que;
	scanf("%d", &n);
	scanf("%s",s+1);
	for (int i = 1; i <= n; i++) {
		scanf("%d", a + i);
	}
	for (int i = 2; i <= n; i++) {
		if (s[i - 1] != s[i]) {
			que.push(node(i - 1, i, abs(a[i] - a[i - 1])));
		}
	}
	int cnt = 0;
	while (!que.empty()) {
		int t1, t2;
		t1 = que.top().x;
		t2 = que.top().y;
		que.pop();
		if (!vis[t1] && !vis[t2]) {
			vis[t1] = true;
			vis[t2] = true;
			ans[++cnt] = make_pair(t1, t2);
			while (t1 > 0 && vis[t1]) {
				t1--;
			}
			while (t2 <= n && vis[t2]) {
				t2++;
			}
			if (t1 > 0 && t2 <= n && s[t1] != s[t2]) {
				que.push(node(t1, t2, abs(a[t1] - a[t2])));
			}
		}
	}
	printf("%d\n", cnt);
	for (int i = 1; i <= cnt; i++) {
		printf("%d %d\n", ans[i].first, ans[i].second);
	}
	return 0;
}