Code_KK的博客

In a 2-D plane, there are n simple polygons. Some polygons may not be convex. Each polygon has atmost k vertices. Each vertex is represented as a pair of x and y coordinates. It is known that for each

题目链接：http://poj.org/problem?id=1151 大致题意：给出n个矩形，求出n个矩形一共覆盖的面积 做法：现将坐标离散化，然后用线段树维护 即让线段按照x坐标的大小从小到大排列，y坐标按照从小到大排列去掉重复的值 然后通过一个扫描线来求扫描线覆盖的y的长度。 线段的扫描按照x的大小从小到大扫描，求出当前扫描线覆盖的矩阵竖线的长度，然后乘以下条线段的跨度

Clockwise Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^ 题目描述 Saya have a long necklace with N beads, and she signs the beads from 1 to N. Then she fixes them to the wall to show N-1

Clockwise Time Limit: 1000ms | Memory limit: 65536K 有疑问？点这里^ 题目描述Saya have a long necklace with N beads, and she signs the beads from 1 to N. Then she fixes them to the wall to show N-1 v