小模板2

---

1.关闭cin,cout 同步

	ios::sync_with_stdio(false);

---

2.快速读入

void read(int &x)
{
	x = 0;
	int f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9') {
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		x *= 10;
		x += (int)(ch-'0');
		ch = getchar();
	}
	x *= f;
}

---

3.归并+逆序对

void merge_sort(int* A, int x, int y, int* T) {
	if(y-x > 1) {
		int m = x + (y-x)/2;
		int p = x, q = m, i = x;
		merge_sort(A, x, m, T);
		merge_sort(A, m, y, T);
		while(p < m || q < y) {
			if(q >= y || (p < m && A[p] <= A[q])) T[i++] = A[p++];
			else {
				T[i++] = A[q++];
				cnt += (LL)(m-p);
			}
		}
		for(i = x; i < y; ++i) A[i] = T[i];
	}	
}

---

4.快排

(1)

void quick_sort(int* a, int l, int r) {
    if (l >= r)
        return;
    int i = l, j = r;
    int t = a[i];
    while(i < j) {
    	while(i < j && a[j] >= t) --j;
    	if(i < j) {
    		a[i] = a[j];
    		++i;
    	}
    	while(i < j && a[i] <= t) ++i;
    	if(i < j) {
    		a[j] = a[i];
    		--j;
    	}
    }
	a[i] = t;    
    quick_sort(a, l, i-1);
    quick_sort(a, i+1, r);
}

(2)

void quick_sort(int* A, int l, int r) {
	if(l >= r)
		return;
	int x = A[r];
	int i = l-1;
	for(int j = l; j < r; ++j) {
		if(A[j] < x) {
			++i;
			int t = A[i];
			A[i] = A[j];
			A[j] = t;
		}
	}
	A[r] = A[++i];
	A[i] = x;
	quick_sort(A, l, i-1);
	quick_sort(A, i+1, r);
}

---