1506E
题意:
两个数组a,b其中bi是max(a1~ai);,求字典序最大和最小的数组a;
思路:
数组b一定是逐渐上升的,假如两个相邻的元素相同那么第二个元素一定是小于前一个的;
这个题可以使用优先队列来做,建立大根堆和小根堆,最大就插入大根堆堆顶,最小就插入小根堆堆顶;
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
const int N = 200010;
int a[N], b[N];
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
map<int, int> mp;
for (int i = 1; i <= n; i++) cin >> a[i], mp[a[i]]++;
priority_queue<int> q_max;
priority_queue<int, vector<int>, greater<int>> q_min;
int x = a[1];
cout << x << " ";
vector<int>v;
v.push_back(x);
for (int i = 1; i < x; i++) q_max.push(i), q_min.push(i);//找到小于x的所有数,插入堆中;
for (int i = 2; i <= n; i++) {
if (x == a[i]) {//输出对应的堆顶元素;
cout << q_min.top() << " ";
q_min.pop();
v.push_back(q_max.top());
q_max.pop();
} else {
for (int j = x + 1; j < a[i]; j++) q_max.push(j), q_min.push(j);//假如对应的堆顶元素;
x = a[i];
v.push_back(x);
cout << x << " ";
}
}
cout << endl;
for (auto i : v) cout << i << " ";
cout << endl;
}
return 0;
}