#includeusing namespace std;#define MY_MAX 1100int Tree[MY_MAX*3][MY_MAX*3];int S;void Add_x(int rooty,int rootx,int L,int R,int x,int a){ Tree[rooty][rootx]+=a; if(L==R)return; int

#include#include#includeusing namespace std;int n;struct CPost{ int L,R;};CPost posters[10100];int x[20200];//海报的端点瓷砖编号 int hash[10000010];//hash[i]表示瓷砖i所处的离散化后的区间编号 struct CNode{ in

#include#includeusing namespace std;#define MY_MAX 220000int C[MY_MAX];typedef vector VCT_INT;vectorG(MY_MAX/2);int Lowbit[MY_MAX];bool HasApple[MY_MAX/2];int Start[MY_MAX];int End[MY_MAX];

#includeusing namespace std;struct CNode{ int L,R; CNode *pLeft,*pRight; long long nSum; long long Inc;};CNode Tree[1000000];int nCount=0;int Mid(CNode *pRoot){ return (pRo

#include#include#include#includeusing namespace std;double y[210];struct CNode{ int L,R; CNode *pLeft,*pRight; double Len; int Covers;};CNode Tree[1000];struct CLine{ do