DoIdo

#include<iostream> #include<algorithm> using namespace std; const int maxn = 1e6 + 10; int u[maxn]; void heapify(int* tree, int n, int i) { if (i >= n + 1) return; int c1 = 2 * i; ...

void merge_sort(int* p, int l, int r) { if (l >= r) return; int mid = l + r >> 1; merge_sort(p, l, mid); merge_sort(p, mid + 1, r); int i = l, j = mid + 1, k = 0; while (i <= mid &...