![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
离散化
Grit_ICPC
Dielts
展开
-
POJ 1151 Atlantis(离散化)
大意:求出不重叠矩形的面积交。思路:同两个x[],y[]分别放x,y坐标,然后枚举标记所有的矩形范围。 最后两相邻点,来求面积。#include<map>#include<queue>#include<cmath>#include<cstdio>#include<stack>#include<iostream>#include<cstring>#include<algorithm>原创 2016-04-25 11:32:23 · 380 阅读 · 0 评论 -
FZU Problem 2227 邮票 (离散化+map+dfs)
#include<map>#include<queue>#include<cmath>#include<cstdio>#include<stack>#include<iostream>#include<cstring>#include<algorithm>#define ll long long#define inf 0x3f3f3f3f#define eps 1e-8#inc原创 2016-04-19 11:53:53 · 454 阅读 · 0 评论