morejarphone~

第一题扫描线，连离散化都不用0.0 #include #include #include #include #include using namespace std; #define maxn 51111 #define pl c<<1 #define pr (c<<1)|1 #define lson tree[c].l,tree[c].mid,c<<1 #define rson tr

#include #include #include #include #include using namespace std; #define maxn 2222 #define pl c<<1 #define pr (c<<1)|1 #define lson tree[c].l,tree[c].mid,c<<1 #define rson tree[c].mid+1,tree[c].

这个是求矩形并的周长，也用扫描线来搞，但是排序的时候不同于面积，在两条线的高度相同是需要优先把下边放在前面（不然有的横边会被多算）。 #include #include #include #include #include using namespace std; #define maxn 5111 #define pl c<<1 #define pr (c<<1)|1 #define

#include #include #include #include #include #include #include using namespace std; #define maxn 81111 #define pb push_back #define mp make_pair double x[maxn], y[maxn], r[maxn]; int n; bool

Moonmist Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1837    Accepted Submission(s): 618 Problem Description An Unidentifie