【算法小结】线段树之扫描树

pre文章：扫描线（线段树）_ღCauchyོꦿ࿐的博客-CSDN博客_线段树扫描线

配套习题：247. 亚特兰蒂斯 - AcWing题库

步骤（以横扫为例）：

 · 对边从左到右排序，对x坐标离散化处理

 · 建树 {

        初始化每个结点所代表的区间的有效长度为零

}

 · 从左到右扫描边，实时更新总有效长度，并累加面积

更新update{

        当前结点所代表的区间包含于所要更新的区间，直接处理并return；

        否则递归处理左右结点；

}

关于pushup{

        如果当前该点.cnt==1，表明该点代表的区间全部有效

        如果当前该点.cnt==0&&该点.l != 该点.r ,那么该点所代表的区间有效长度由子节点决定

        叶结点&&cnt==0 直接清空有效长度

}

#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
struct Line {
	double x, y1, y2, d;
	bool operator <(const Line& A) const {
		return x < A.x;
	}
}line[N<<1];
struct node {
	int l, r, cnt;
	double len;
}tr[N<<2];
vector<double> ys;
int n, t;
int find(double x) {
	return lower_bound(ys.begin(), ys.end(), x) - ys.begin();
}
void pushup(int u) {
	if (tr[u].cnt) tr[u].len = ys[tr[u].r + 1] - ys[tr[u].l];
	else if (tr[u].l != tr[u].r) tr[u].len = tr[u << 1].len + tr[u << 1 | 1].len;
	else tr[u].len = 0;
}
void build(int u, int l, int r) {
	tr[u] = { l,r,0,0 };
	if (l == r) return;
	int mid = l + r >> 1;
	build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
}
void modify(int u, int l, int r, int k) {
	if (l <= tr[u].l && tr[u].r <= r) {
		tr[u].cnt += k;
		pushup(u); return;
	}
	int mid = tr[u].l + tr[u].r >> 1;
	if (l <= mid) modify(u << 1, l, r, k);
	if (r > mid) modify(u << 1 | 1, l, r, k);
	pushup(u);
}
int main() {
	while (cin >> n, n) {
		ys.clear();
		double x1, y1, x2, y2;
		int j = 0;
		for (int i = 0; i < n; i++) {
			cin >> x1 >> y1 >> x2 >> y2;
			line[j++] = { x1,y1,y2,1 };
			line[j++] = { x2,y1,y2,-1 };
			ys.push_back(y1), ys.push_back(y2);
		}
		sort(line, line + j);
		sort(ys.begin(), ys.end());
		ys.erase(unique(ys.begin(), ys.end()), ys.end());

		build(1, 0, ys.size() - 2);

		double res = 0;
		for (int i = 0; i < j; i++) {
			if (i) res += tr[1].len * (line[i].x - line[i - 1].x);
			modify(1, find(line[i].y1), find(line[i].y2) - 1, line[i].d);
		}
		printf("Test case #%d\n", ++t);
		printf("Total explored area: %.2lf\n\n", res);
	}
	return 0;
}#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
struct Line {
	double x, y1, y2, d;
	bool operator <(const Line& A) const {
		return x < A.x;
	}
}line[N<<1];
struct node {
	int l, r, cnt;
	double len;
}tr[N<<2];
vector<double> ys;
int n, t;
int find(double x) {
	return lower_bound(ys.begin(), ys.end(), x) - ys.begin();
}
void pushup(int u) {
	if (tr[u].cnt) tr[u].len = ys[tr[u].r + 1] - ys[tr[u].l];
	else if (tr[u].l != tr[u].r) tr[u].len = tr[u << 1].len + tr[u << 1 | 1].len;
	else tr[u].len = 0;
}
void build(int u, int l, int r) {
	tr[u] = { l,r,0,0 };
	if (l == r) return;
	int mid = l + r >> 1;
	build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
}
void modify(int u, int l, int r, int k) {
	if (l <= tr[u].l && tr[u].r <= r) {
		tr[u].cnt += k;
		pushup(u); return;
	}
	int mid = tr[u].l + tr[u].r >> 1;
	if (l <= mid) modify(u << 1, l, r, k);
	if (r > mid) modify(u << 1 | 1, l, r, k);
	pushup(u);
}
int main() {
	while (cin >> n, n) {
		ys.clear();
		double x1, y1, x2, y2;
		int j = 0;
		for (int i = 0; i < n; i++) {
			cin >> x1 >> y1 >> x2 >> y2;
			line[j++] = { x1,y1,y2,1 };
			line[j++] = { x2,y1,y2,-1 };
			ys.push_back(y1), ys.push_back(y2);
		}
		sort(line, line + j);
		sort(ys.begin(), ys.end());
		ys.erase(unique(ys.begin(), ys.end()), ys.end());

		build(1, 0, ys.size() - 2);

		double res = 0;
		for (int i = 0; i < j; i++) {
			if (i) res += tr[1].len * (line[i].x - line[i - 1].x);
			modify(1, find(line[i].y1), find(line[i].y2) - 1, line[i].d);
		}
		printf("Test case #%d\n", ++t);
		printf("Total explored area: %.2lf\n\n", res);
	}
	return 0;
}