A 算法10-10,10-11:堆排序
- 堆排序,套模板即可。参考代码如下。
#include<iostream>
#include<algorithm>
const int maxn = 100010;
using namespace std;
int s[maxn];
void down_adjust(int low, int high) {
int i = low, j = low * 2;
while (j <= high) {
if (j + 1 <= high && s[j + 1] > s[j]) j++;
if (s[j] > s[i]) {
swap(s[j], s[i]);
i = j;
j = 2 * i;
}
else break;
}
}
void up_adjust(int low, int high) {
int j = high / 2, i = high;
while (j >= low) {
if (s[j] < s[i]) {
swap(s[j], s[i]);
i = j;
j = i / 2;
}
else break;
}
}
void create_heap(int n) {
for (int i = n / 2; i >= 1; i--)
down_adjust(i, n);
}
void delete_top(int &n) {
s[1] = s[n--];
down_adjust(1, n);
}
void insert(int &n, int x) {
s[++n] = x;
up_adjust(1, n);
}
void heap_sort(int n) {
create_heap(n);
for (int i = n; i > 1; i--) {
swap(s[i], s[1]);
down_adjust(1, i - 1);
}
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> s[i];
heap_sort(n);
for (int i = 1; i <= n; i++)
cout << s[i] << ' ';
cout << endl;
return 0;
}
B 序列合并
- 题目建议用最小堆实现,可我想来想去也不会啊 Σ(っ°Д°;)っ 要么空间太大,要么时间不太行。
- 这里采用了暴力+优化的方法。定义一个优先级队列 pq ,队列顶部为最大的元素。循环计算每一个当前和 A[i] + B[j],如果 pq 的大小不到 n,则把当前和压入 pq;如果 pq 大小为 n,则比较 pq 顶部元素与当前和的大小,若当前和比 pq 顶部元素大,则中止本次循环,否则将当前和加入 pq,弹出 pq 顶部的元素。最后要将 pq 逆序输出,这里采用栈预存了一下。参考代码如下。
#include<iostream>
#include<queue>
#include<stack>
const int maxn = 100005;
using namespace std;
int A[maxn], B[maxn];
priority_queue <int> pq;
stack <int> s;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> A[i];
for (int i = 0; i < n; i++) cin >> B[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (pq.size() < n)
pq.push(A[i] + B[j]);
else if (pq.size() == n) {
if (A[i] + B[j] < pq.top()) {
pq.push(A[i] + B[j]);
pq.pop();
}
else break;
}
}
while (pq.size()) {
s.push(pq.top());
pq.pop();
}
cout << s.top(); s.pop();
while (s.size()) {
cout << ' ' << s.top();
s.pop();
}
cout << endl;
return 0;
}
C 合并果子(堆)
- 建立最小堆,每次从堆顶取两个元素,设置 sum 累加这两个元素的和,然后将这两个元素的和放入堆中,重复进行 n-1 次,堆中只剩一个元素,此时 sum 即为所需最小体力值。参考代码如下。
#include<iostream>
#include<algorithm>
const int maxn = 30005;
using namespace std;
int heap[maxn];
void down_adjust(int low, int high) {
int i = low, j = low * 2;
while (j <= high) {
if (j + 1 <= high && heap[j] > heap[j + 1]) j++;
if (heap[i] > heap[j]) {
swap(heap[i], heap[j]);
i = j;
j = i * 2;
}
else break;
}
}
void up_adjust(int low, int high) {
int i = high, j = high / 2;
while (j >= low) {
if (heap[i] < heap[j]) {
swap(heap[i], heap[j]);
i = j;
j = i / 2;
}
else break;
}
}
void create_heap(int n) {
for (int i = n / 2; i >= 1; i--)
down_adjust(i, n);
}
void insert(int &n, int x) {
heap[++n] = x;
up_adjust(1, n);
}
void delete_top(int &n) {
heap[1] = heap[n--];
down_adjust(1, n);
}
int main() {
int sum = 0, n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> heap[i];
create_heap(n);
int num = n;
for (int i = 1; i < num; i++) {
int t1 = heap[1]; delete_top(n);
int t2 = heap[1]; delete_top(n);
sum += t1 + t2;
insert(n, t1 + t2);
}
cout << sum << endl;
return 0;
}
PS:感觉手写堆比较麻烦,一般情况下还是用优先级队列吧。