Educational Codeforces Round 96 (Rated for Div. 2) E题（逆序对）

思路
但是我的代码感觉更好

/*********************************************************************
    程序名:
    版权: Joecai
    作者: Joecai
    日期: 2022-04-07 22:40
    说明:
*********************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
# define rep(i,be,en) for(int i=be;i<=en;i++)
# define pre(i,be,en) for(int i=be;i>=en;i--)
typedef pair<int, int> PII;
#define ll long long
#define endl "\n"
#define LOCAL
#define pb push_back
#define eb emplace_back
#define sp(i) setprecision(i)
const int N = 2e5 + 10, INF = 0x3f3f3f3f;
int tr[N];

inline int lowbit(int x)
{
	return x & -x;
}



void up(int x)
{
	for (int i = x; i < N; i += lowbit(i))
	{
		tr[i]++;
	}
}


ll query(int x)
{
	ll sum = 0;
	for (int i = x; i; i -= lowbit(i))
	{
		sum += tr[i];
	}
	return sum;
}


vector<int>g[29];
int c[N];


void solve()
{
	int n;
	cin >> n;
	string s;
	cin >> s;
	for (int i = 0; i < n; i++)
	{
		int x = s[i] - 'a';
		g[x].push_back(n - i);
	}

	for (int i = 0; i < n; i++)
	{
		int x = s[i] - 'a';
		c[i] = g[x].back();
		g[x].pop_back();
	}

	ll ans = 0;
	for (int i = 0; i < n; i++)
	{
		int t = c[i];
		ans += i - query(t);
		up(t);
	}
	cout << ans << endl;
}




int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	//#ifdef LOCAL
	//freopen("data.in.txt","r",stdin);
	//freopen("data.out.txt","w",stdout);
	//#endif
	int __ = 1;
	//cin>>__;
	while (__--)
	{
		solve();
	}
	return 0;
}