Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

上面说了,分层是一种思想,处理的时候不用那么复杂

Posted by twilight at 2009-09-12 21:56:34
In Reply To:Re:分层之后就是普通的离散化+线段树求面积并了 Posted by:zfacmilan at 2009-09-12 21:29:00

int value[4];
value[0]=0;
先把value按增序排列,把读入的矩形的标号转换一下,对应新的增序
离散化,排序
建树

sum=0;
第i次扫描(1<=i<=3)
{
    1.把"等级"大于等于i的线段拿出来,放到新的数组中
    2.对新的数组的线段求面积并,得S
    3.sum+=S*(value[i]-value[i-1])
}

Followed by:

Re:上面说了,分层是一种思想,处理的时候不用那么复杂 (18) lysaitl 2009-09-12 22:04:11
- 自己画个图就好了 (0) twilight 2009-09-12 22:07:00
  - Re:自己画个图就好了 (14) lysaitl 2009-09-12 22:08:26

Post your reply here:

Home Page Go Back To top