wuzhibin

摘要： /*ID:billat11LANG:CTASK:namenum*/#include<iostream>#include<cstdio>#include<cstdarg>#include<stdlib.h>#include<cstring>#include<cmath>using namespace std;const int N=100005;struct node{ int l; int r; int times;}allNode[3*N];void build(int l,int r,int n){ if(l==r) 阅读全文

摘要： 法一：二维线段树#include<iostream>#include<cstdio>#include<cstdarg>#include<stdlib.h>#include<cstring>#include<cmath>using namespace std;const int N=10005;struct Node{ int xMin; int xMax; int yMin; int yMax; int area; bool cover;}aNode[3*N];void build(int xMin,int xMax,in 阅读全文