时限 1s
输入:
5 2 1 1 3 4
输出:
2 1 3 4 5
思路:暴力只能过80%,优化了一下,计算重复数字步数还是tle,不会优化T w T
正解
并查集(这也能并查集???还是见的太少
利用并查集,核心是将访问过的数字和它的下一个数字放在同一个集合,比如访问过1,2,再去访问1或者2的时候,如果是发现是重复元素就会就会直接定位到3,妙哉
//并查集
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define _for(i,a,b) for(int i=(a) ;i<=(b) ;i++)
#define _rep(i,a,b) for(int i=(a) ;i>=(b) ;i--)
#define mst(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin() , v.end()
#define pb(v) push_back(v)
#define INF 0x3f3f3f3f
#define int long long
#define lson p*2,l,mid
#define rson p*2+1,mid+1,r
typedef long long ll;
const int N = 1e5+10;
const int M = 1e6+10;
int fa[M];
int a[N];
int n;
int find(int x)
{
return fa[x] == x? x:fa[x] = find(fa[x]);
}
void merge(int x ,int y)
{
int xx = find(x);
int yy = find(y);
fa[xx] = yy;
}
signed main()
{
//!!!!!!!!!!!!!!!!!!!!!!
// freopen("data.txt","r",stdin);
//!!!!!!!!!!!!!!!!!!!!!!
IOS;
_for(i,0,M) fa[i] = i;
cin>>n;
_for(i,1,n)
{
cin>>a[i];
int root = find(a[i]);
a[i] = root;
merge(a[i] , a[i]+1 );
}
_for(i,1,n)
{
cout<<a[i]<<" ";
}
cout<<endl;
}