60分TLE求优化
查看原帖
60分TLE求优化
1179906
hhy8399楼主2024/10/5 17:14
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5;

int T;

void re()
{
	int n,m;
	map<int,int > pos;
	vector<int> num;
	cin >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> m;
		if(pos[m] == 0)
		{
			pos[m] ++;
			num.push_back(m);
		}
	}
	for(int i = 0;i < (int)num.size();i++)
	{
		cout << num[i] << " "; 
	}
	cout << endl;
	return ;
}

int main()
{
	cin >> T;
	while(T--)
	{
		re();
	}
	return 0;
}
2024/10/5 17:14
加载中...