2761: [JLOI2011]不重复数字
BZOJ 2761
/**************************************************************
Problem: 2761
User: Dream_Tonight
Language: C++
Result: Accepted
Time:968 ms
Memory:1556 kb
****************************************************************/
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 6e6 + 7;
const int inf = 0x7fffffff;
set<int> st;
int main() {
int t, n, x;
scanf("%d", &t);
while (t--) {
st.clear();
st.insert(inf);
st.insert(-inf);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d",&x);
if(st.find(x) != st.end())continue;
st.insert(x);
if(i==0) printf("%d",x);
else printf(" %d",x);
}
printf("\n");
}
}