分治
Phoenix丶HN
这个作者很懒,什么都没留下…
展开
-
hdu 5721 空间点对距离,记录点
#includeusing namespace std;typedef long long ll;const ll INF=0x3f3f3f3f3f3f3f3f;int flag;struct node1{ ll x,y; int id;}node[100010],node2[100010];int cmpx(node1 p1,node1 p2){ if原创 2017-04-20 11:23:03 · 280 阅读 · 0 评论 -
平面最小点对 模板(hdu1007 uva10245)
#includeusing namespace std;typedef long long ll;const int INF=0x3f3f3f3f;struct node1{ double x,y;}node[100010];int cmpx(node1 p1,node1 p2){ return p1.x<p2.x;}int cmpy(node1 p1,n原创 2017-04-20 10:11:52 · 377 阅读 · 0 评论 -
树重心分解,求点对。
#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;const int INF=0x3f3f3f3f;int n,ans,k;int vis[1原创 2017-04-19 17:15:00 · 319 阅读 · 0 评论 -
hdu 5730 (CDQ+FFT)模板题
Shell NecklaceTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 866 Accepted Submission(s): 383Problem DescriptionPerhaps the sea‘原创 2017-03-08 18:25:52 · 332 阅读 · 0 评论 -
平面点集最短距离,记录两点的代码!
hdu 5721#include #include #include #include #include #include #include #include #include #include #include #include #define LL long long#define Pr pair#define fread(ch) freopen(ch,"r原创 2017-03-03 16:25:09 · 1095 阅读 · 0 评论 -
区间点集最短两点距离
findd函数模板,分治#include #include #include #include #includeusing namespace std;struct node1{ int x,y;}node[100010],node2[100010];int cmpx(node1 p1,node1 p2){ return p1.x<p2.x;原创 2017-03-03 16:22:07 · 1825 阅读 · 0 评论 -
hdu1007
Quoit DesignTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46494 Accepted Submission(s): 12122Problem DescriptionHave you ever原创 2016-07-25 15:04:31 · 286 阅读 · 0 评论