#include<iostream> #include<cstdio> #include<queue> #include<stack> #include<cstring> #include <cctype> using namespace std; inline void read(int &x) { x=0;int f=1;char c=getchar(); while(c<'0'||c>'9'){if(c=='-') f=-1; c=getchar();} while(c&l...

#include<iostream> #include<cstdio> #include<cmath> #include<queue> #define ll long long #define rint register int using namespace std; template<typename xxx>void read(xxx &x) { x=0;int f=1;char c=getchar(); for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=...

#include<iostream> #include<cstdio> #include<cmath> #include<queue> #include<cstring> #include<algorithm> #define lson x<<1 #define rson x<<1|1 #define ll long long #define rint register int #define mp(x,y) make_pair(x,y) using namespace std; template&...

#include<iostream> #include<cstdio> #include<cmath> #include<queue> #include<cstring> #include<algorithm> #define lson x<<1 #define rson x<<1|1 #define ll long long #define rint register int #define mp(x,y) make_pair(x,y) using namespace std; template&...

# #### 蒟蒻第一次发题解（~~外加第一次用MARKDOWN~~） 一眼就能看出的二分题 主函数中二分枚举答案， 判断时每次将合理x轴范围p[i].x到p[i].x+qh-1内所有点按照p[i].y从小到大排序，再以要求的个数分组判断是否在区间内 核心代码 ### # if(p[sb[j]].y-p[sb[j-c+1]].y+1<=qh) return 1; 以下是代码 ``` #include<iostream> #include<cstdio> #include<cmath> #include<algorithm> #include...