蒟蒻求助

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
const int N = 100005;
int a[N], dis[N];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	
	int n, t;
	scanf("%d", &t);
	while(t--)
	{
		cin >> n;
		for (int i = 1; i <= n; i++)
		{
			cin >> a[i];
			dis[i] = a[i];
		}
		sort(a+1, a+1+n);
		int v = unique(a+1, a+1+n) - (a+1);
		for (int i = 1; i <= n; i++)
		{
			dis[i] = lower_bound(a+1, a+1+v, dis[i]) - a;
		}
		
		for (int i = 1; i <= n; i++)
		{
			cout << dis[i] << " ";
		}
		cout << '\n';
	}
	return 0;
}