思路一:并查集 father[]保存的是集合中最大的值。
注意:合并的时候 是 unin(father[a], father[a] + 1); 而不是 unin(a, a + 1);因为输出的是father[a].
#include <bits/stdc++.h>
using namespace std;
//并查集 father[i] 存储数字i要变的值
const int maxn = 1000005;
int father[maxn];
void init(){
for (int i = 0; i < 1000005; ++i){
father[i] = i;
}
}
int findfather(int i){
if (i == father[i]) return i;
return father[i] = findfather(father[i]);
}
void unin(int m, int n){
int fam = findfather(m);
int fan = findfather(n);
if (fam != fan) father[fam] = fan;
}
int main(){
int n;
init();
cin >> n;
int a;
for (int i = 0; i < n; ++i){
cin >> a;
cout << findfather(a) << " ";
unin(findfather(a), findfather(a) + 1);
}
return 0;
}
思路二: 用set维护一个数组。
写代码的时候遇到很多问题!!
#include <bits/stdc++.h>
using namespace std;
int a[1000005];
int main(){
set<pair<int, int> > st; //区间左值 区间右值
//刚开始判断的时候st是空的,所以要加上边界条件
st.insert(make_pair(-1000005, -1000005));
st.insert(make_pair(1000005, 1000005));
int n;
cin >> n;
for (int i = 0; i < n; ++i){
cin >> a[i];
//必须写成1000005,如果已经有1 2,再插入1,如果写成a[i],则[1,2]大于[1,1] !!
set<pair<int, int> >::iterator dayu = st.upper_bound(make_pair(a[i], 1000005));
set<pair<int, int> >::iterator xiaoyudengyu = dayu; //不能写成dayu-1!!
//不支持-1时,可以像这样分两句用--来写!!
//upper_bound 是返回大于的迭代器, lower_bound返回大于等于的迭代器!!
xiaoyudengyu--;
if (xiaoyudengyu->second >= a[i]){ //通过xiaoyudengyu的second来更新!!
a[i] = xiaoyudengyu->second + 1;
}
//维护区间
if (a[i] == xiaoyudengyu->second + 1 && a[i] == dayu->first - 1){
st.insert(make_pair(xiaoyudengyu->first, dayu->second));
st.erase(xiaoyudengyu);
st.erase(dayu);
}else if (a[i] == xiaoyudengyu->second + 1){
st.insert(make_pair(xiaoyudengyu->first, xiaoyudengyu->second + 1));
st.erase(xiaoyudengyu);
}else if (a[i] == dayu->first - 1){
st.insert(make_pair(dayu->first - 1, dayu->second));
st.erase(dayu);
}else {
st.insert(make_pair(a[i], a[i])); //区间合并若都不满足时也要更新!
}
}
for (int i = 0; i < n; ++i){
cout << a[i];
if (i != n){
cout << " ";
}
}
cout << endl;
return 0;
}