poj 1177 / hdu 1828 线段树 离散化 扫描线

题目链接：http://poj.org/problem?id=1177

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1828

题目大意：有多个矩形并在一起，求组成的图形的周长。

代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define maxn 5005
struct Line
{
      int xl, xr, y, tp;
      Line(){}
      Line(int a, int b, int c, int d)
      {
            xl = a;
            xr = b;
            y = c;
            tp = d;
      }
      bool operator < (const Line& b)const
      {
            return y<b.y;
      }
}line[maxn<<1];
int x[maxn<<1];
struct node
{
      int l, r;
      int tp;//当前结点是否被覆盖
      int num;//当前结点被分割成多少个不连续的小段，用于计算平行于y轴的线段长度
      int length;//当前结点被覆盖的长度
      bool lb, rb;//标记当前结点的左右两端是否被覆盖
}v[maxn<<2];
void build(int l, int r, int n)
{
      v[n].l = l, v[n].r = r;
      v[n].length = v[n].num = v[n].tp = 0;
      v[n].lb = v[n].rb = 0;
      if (l+1==r)
            return ;
      int mid = (l+r) >> 1;
      build(l, mid, n<<1);
      build(mid, r, n<<1|1);
}
void pushup(int n)
{
      if (v[n].tp>0)
      {
            v[n].length = x[ v[n].r ] - x[ v[n].l ];
            v[n].num = v[n].lb = v[n].rb = 1;
      }
      else if (v[n].l+1 == v[n].r)
      {
            v[n].length = v[n].num = v[n].lb = v[n].rb = 0;
      }
      else
      {
            v[n].length = v[n<<1].length + v[n<<1|1].length;
            v[n].lb = v[n<<1].lb;
            v[n].rb = v[n<<1|1].rb;
            v[n].num = v[n<<1].num+v[n<<1|1].num - v[n<<1].rb*v[n<<1|1].lb;
      }
}
void update(int n, int xl, int xr, int tp)
{
      int vnl = x[v[n].l], vnr = x[v[n].r];
      if (xl<=vnl && vnr<=xr)
      {
            v[n].tp += tp;
            pushup(n);
            return ;
      }
      int mid = (v[n].l + v[n].r) >> 1;
      if (xr<=x[mid])
            update(n<<1, xl, xr, tp);
      else if (xl>=x[mid])
            update(n<<1|1, xl, xr, tp);
      else
      {
            update(n<<1, xl, x[mid], tp);
            update(n<<1|1, x[mid], xr, tp);
      }
      pushup(n);
}
int main()
{
      int n;
      while (~scanf("%d", &n) && n)
      {
            int num = 0;
            for (int i=0; i<n; ++i)
            {
                  int x1, x2, y1, y2;
                  scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
                  line[++num] = Line(x1, x2, y1, 1);
                  x[num] = x1;
                  line[++num] = Line(x1, x2, y2, -1);
                  x[num] = x2;
            }
            sort(x+1, x+num+1);
            sort(line+1, line+num+1);
            n = unique(x+1, x+num+1) - x - 1;
            int ans = 0, last = 0, lines = 0;
            build(1, n, 1);
            for (int i=1; i<=num; i++)
            {
                  update(1, line[i].xl, line[i].xr, line[i].tp);
                  if (i>1)
                        ans += 2*lines*(line[i].y - line[i-1].y);
//                  cout << abs(v[1].length - last) << endl;
                  ans += abs(v[1].length - last);
                  last = v[1].length;
                  lines = v[1].num;
            }
            printf("%d\n", ans);
      }
      return 0;
}