求矩形并后的轮廓。陈宏的线段树对这个问题分析的相当的好。但是,我对这个扫描理解的还不是很透彻。需要回国头来再好好看看!我觉得,有些东西随着时间,自己慢慢琢磨琢磨,多回国头来看看,也许不经意间,就能理解很多了。最终也就明白了!
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 40005
struct SegTree
{
int l,r;
int c,m;
int rb,lb;
int sline;
}tree[N];
struct Line
{
int x,y1,y2;
bool flag;
}line[N/4];
bool cmp(Line a,Line b)
{
return a.x<b.x;
}
void BulidTree(int root,int l,int r)
{
tree[root].l=l;
tree[root].r=r;
tree[root].c=0;
tree[root].m=0;
tree[root].lb=0;
tree[root].rb=0;
tree[root].sline=0;
if(r-l==1)return;
int mid=(l+r)/2;
BulidTree(2*root,l,mid);
BulidTree(2*root+1,mid,r);
}
void Updata(int root) //更新的操作,陈宏的线段树中说的很详细
{
if(tree[root].c>0)
{
tree[root].m=tree[root].r-tree[root].l;
tree[root].lb=tree[root].rb=1;
tree[root].sline=1;
}
else if(tree[root].r-tree[root].l==1)
{
tree[root].m=0;
tree[root].lb=tree[root].rb=0;
tree[root].sline=0;
}
else
{
tree[root].m=tree[2*root].m+tree[2*root+1].m;
tree[root].sline=tree[2*root].sline+tree[2*root+1].sline-(tree[2*root].rb&tree[2*root+1].lb);
tree[root].lb=tree[2*root].lb;
tree[root].rb=tree[2*root+1].rb;
}
}
void insert(int root,int l,int r)
{
if(l<=tree[root].l&&tree[root].r<=r)
{
tree[root].c++;
Updata(root);
return;
}
int mid=(tree[root].l+tree[root].r)/2;
if(l<mid)insert(2*root,l,r);
if(r>mid)insert(2*root+1,l,r);
Updata(root);
}
void Delet(int root,int l,int r)
{
if(l<=tree[root].l&&tree[root].r<=r)
{
tree[root].c--;
Updata(root);
return;
}
int mid=(tree[root].l+tree[root].r)/2;
if(l<mid)Delet(2*root,l,r);
if(r>mid)Delet(2*root+1,l,r);
Updata(root);
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int lowy=10001,highy=-10001;
for(int i=0;i<n;i++)
{
int x1,y1,x2,y2;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
line[2*i].flag=true;
line[2*i].x=x1;
line[2*i].y1=y1;
line[2*i].y2=y2;
line[2*i+1].flag=false;
line[2*i+1].x=x2;
line[2*i+1].y1=y1;
line[2*i+1].y2=y2;
if(lowy>y1)lowy=y1;
if(highy<y2)highy=y2;
}
n<<=1;
sort(line,line+n,cmp);
BulidTree(1,lowy,highy);//以纵坐标组成的闭区间做为建立线段树的区间
int perimeter=0,t=0; //是为了扫描的时候,沿着y轴扫描
for(int i=0;i<n;i++)
{
if(line[i].flag)
{
insert(1,line[i].y1,line[i].y2);
}
else
{
Delet(1,line[i].y1,line[i].y2);
}
perimeter+=tree[1].sline*(line[i+1].x-line[i].x)*2;
perimeter+=abs(tree[1].m-t);
t=tree[1].m;
}
printf("%d\n",perimeter);
}
return 0;
}