爆零

P4305 [JLOI2011] 不重复数字

```cpp #include<bits/stdc++.h> using namespace std; const int mn=0x3f3f3f3f; struct node { int id,val; }a[50001]; int n,t,sum; bool cmp(node x,node y) { return x.val<y.val; } bool cmpp(node x,node y) { return x.id<y.id; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin>>t; a[0].val=-mn; while(t--) { cin>>n; memset(a,0,sizeof(a)); for(int i=1;i<=n;i++) { cin>>a[i].val; a[i].id=i; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++)//去重 { if(a[i].val!=sum) { sum=a[i].val; } else { a[i].id=mn; } } sort(a+1,a+n+1,cmpp); for(int i=1;i<=n;i++)//还原顺序 { if(a[i].id==mn) { break; } cout<<a[i].val<<' '; } cout<<endl; } return 0; } ```
by xh001 @ 2023-03-13 22:09:47


是TLE还是WA
by LBYYSM_123 @ 2023-03-13 23:29:58


WA
by xh001 @ 2023-03-18 15:44:31


|