poj1177 Picture 扫描线+线段树+离散化
#include#include#include#includeusing namespace std;#define L(x) (x<<1)#define R(x) (x<<1|1)const int MAXN=10000+100;int n,edge_cnt;int y[MAXN];struct node{ bool lc,rc; //记录边界是否被覆盖
