【POJ】分治算法题目

3A:重要逆序对

http://algorithm.openjudge.cn/2020hw1/3A/

• 题目：一个数列中，排在前面的数比排在后面的数大2倍，称为重要逆序对。计算数列中，重要逆序对的个数。
• 思路：使用分治算法的归并排序：将数列从中间一分为二，对左边排序；对右边排序；左右使用两个指针，将小的存入b数组，当右边比左边小时，二分查找左边比右边大2倍的数的位置。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;

const int maxn = 200010;
int a[maxn], b[maxn];
int n;
long long ans;

void mergeSort(int low, int high);
void merge(int low, int mid, int high);
int binarySearch(int l, int r, int key);

int main(){
	while (cin >> n&&n){
		//初始化
		ans = 0;
		//输入
		for (int i = 0; i < n; i++)
			cin >> a[i];
		//分治
		mergeSort(0, n-1);
		//输出
		printf("%lld\n", ans);
	}
	return 0;
}

int binarySearch(int l,int r,int key){
	int p=r+1;
	while (l <= r){
		if (l == r){
			if (a[l]>key)
				p = l;
			break;
		}
		int mid = (l + r) >> 1;
		if (a[mid] > key)
			r = mid;
		else
			l = mid + 1;
	}
	return p;
}

void merge(int low, int mid, int high){
	int i = low, j = mid + 1,k=0;
	while (k < high - low + 1){
		if (i > mid)
			b[k++] = a[j++];
		else if (j>high)
			b[k++] = a[i++];
		else{
			if (a[i] > a[j]){
				ans += mid + 1 - binarySearch(i, mid, 2 * a[j]);
				b[k++] = a[j++];
			}
			else
				b[k++] = a[i++];
		}
	}
	for (int i = 0; i < k; i++)
		a[i + low] = b[i];
}
void mergeSort(int low, int high){
	if (low == high)
		return;
	int mid = (low + high) >> 1;
	mergeSort(low, mid);
	mergeSort(mid+1, high);
	merge(low, mid, high);
}

3B:Raid

http://algorithm.openjudge.cn/2020hw1/3B/

• 题目：计算点集1和点集2中两个点最近距离。
• 思路：先对所有点x坐标排序，(只有一个点距离记为∞，有两个点若不同记为这两个点距离，相同记为∞)。找左半部分点的最近距离d1，右半部分点最近距离d2，记d=min(d1,d2)，找所有x距离中间点小于等于d的点，对这些点y坐标排序，两两比较得到最短距离。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn = 2010;
const int inf = 0x3f3f3f3f;
struct Point{
	int x, y;
	int g;//0 or 1
}p[maxn],p1[maxn];
int t, n;

bool cmp_x(Point a, Point b){
	return a.x < b.x;
}
bool cmp_y(Point a, Point b){
	return a.y < b.y;
}
double dis(Point a, Point b){
	return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
int absol(int x){
	return x>0 ? x : -x;
}
double close_pair(int low, int high){
	int k = 0;
	if (low == high)
		return inf;
	if (low + 1 == high){
		if (p[low].g != p[high].g)
			return dis(p[low], p[high]);
		return inf;
	}
	int mid = (low + high) >> 1;
	double d1 = close_pair(low, mid);
	double d2 = close_pair(mid+1,high);
	double d = min(d1, d2);
	for (int i = 1; i <= 2 * n; i++){
		if (absol(p[i].x - p[mid].x) <= d)
			p1[k++] = p[i];
	}
	sort(p1, p1 + k, cmp_y);
	for (int i = 0; i < k; i++){
		for (int j = i + 1; j < k; j++){
			if (p1[i].g != p1[j].g){
				d = min(d, dis(p1[i], p1[j]));
			}
		}
	}
	return d;
}
int main(){
	 cin >> t;
	while (t--){
		cin >> n;
		for (int i = 1; i <= n; i++){
			cin >> p[i].x >> p[i].y;
			p[i].g = 0;
		}
		for (int i = n+1; i <= 2*n; i++){
			cin >> p[i].x >> p[i].y;
			p[i].g = 1;
		}
		sort(p + 1, p + 2 * n + 1, cmp_x);
		printf("%.3lf\n",close_pair(1, 2 * n));
	}
	return 0;
}