qq_44527245的博客

1.快排 struct node { int id; long long int val; } a[1000001], e; int vis[1000001]; void sort(int l, int r) { int left = l, right = r, i; int t = a[(l + r) >> 1].val; while (left <= right) { while (a[left].val < t &