educational round 96 D.String Deletion

把所有区间长度都筛选出来，对1~k个区间
如果区间长度为1，找最近的一个区间长度>1的区间删点，如果不存在说明后续都是长度为1的区间直接ans += (k - i +1) /2
否则 ans++,对应区间长度减一，使用set解这个问题

#include<bits/stdc++.h>
#define debug(x) cout<<#x<<" is "<<x<<endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define DBG 0
const int N = 2e5 + 5;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LLINF = (1LL<<60);
using namespace std;
const int mod = 998244353;

char s[N];
int inter[N];

struct point{
	int x,i;
	point(int _x,int _i):x(_x),i(_i){
	}
	bool operator <(const point & p)const{
		return i < p.i;
	}
};
set<point> ss;
int main(){
	int t,n;
	cin>>t;
	while(t--){
		cin>>n;
		for(int i = 1;i <= n;i++)inter[i] = 0;
		cin>>(s + 1);
		int k = 0;
		int ans = 0;
		for(int i = 1;i <= n;i++){
			if(s[i] != s[i - 1])++k;
			inter[k]++;
		}
		for(int i = 1;i <= k;i++){
			if(inter[i] > 1)ss.insert(point(inter[i],i));
		}
		for(int i = 1;i <= k;i++){
			if(inter[i] > 1){
				auto it = ss.find(point(inter[i],i));
				ss.erase(it);
				ans++;
			}else{
				if(ss.empty()){
					ans += (k - i + 1)/2 + (k - i + 1) % 2;  
					break; 
				}else{
					auto it = ss.begin();
					int x = (*it).x,idx = (*it).i;
					inter[idx] = x - 1;
					ss.erase(it);
					if(inter[idx] > 1)ss.insert(point(inter[idx],idx));
					ans++;
				}
			}
		}
		ss.clear();

		cout<<ans<<endl;
	}
	return 0;
}