#include<bits/stdc++.h>
using namespace std ;
using ll = long long;
using PII = pair<int,int>;
//using = pair<int,int>;
using VI = vector<int>;
const int mod = 10007;
int n,m,t;
priority_queue<pair<int,PII>,vector<pair<int,PII>>,greater<pair<int,PII>>>p;
int main(){
cin>>n;
string s;
VI r(n+2,0),l(n+2,0);
VI d(n+2,0),del(n+2,0);
vector<PII> res;
cin>>s;
s = " " + s;
for(int i=1;i<=n;i++) cin>>d[i];
for(int i=1;i<n;i++) r[i] = i + 1;
for(int i=2;i<=n;i++) l[i] = i - 1;
r[n] = 0;
for(int i=1;i<n;i++){
if(s[i] != s[i+1]) p.push({abs(d[i]-d[i+1]),{i,i+1}});
}
while(p.size()){
auto x = p.top();
p.pop();
auto i = x.second;
if(del[i.first] == 1 || del[i.second] == 1) {
continue;
}
res.push_back({i.first,i.second});
int pre = l[i.first];
int ne = r[i.second];
del[i.first] = 1;
del[i.second] = 1;
r[pre] = ne;
l[ne] = pre;
if(s[pre] != s[ne] && pre && ne){
p.push({abs(d[pre] - d[ne]),{pre,ne}});
}
}
cout<<res.size()<<"\n";
for(auto x:res){
cout<<x.first<<" "<<x.second<<"\n";
}
}
维护双链表的正确用法,
堆中要存三个元素,值 x,y
一开始我是想只存左点,然后根据r[i] 求 右边的点,但是由于你当时入堆时的值 是 对应的x,y
如果y先被删掉,x就和别的 点连起来了。
大概就是这样,用双链表维护整个序列