//1.AC:return cmul(sub(c,a),sub(b,a));
// WA:return cmul(sub(b,a),sub(c,a));
//2.AC:sum[k]=sum[ls[k]]+sum[rs[k]]+c[k];
// WA:sum[k]=sum[ls[k]]+sum[rs[k]];
#include<algorithm>
#include<iostream>
#include<cstdio>
#define N 2005
using namespace std;
struct point{int x,y,id,c;}p[N];
int n,m,x,y,q,root,size,ans,tmp,f[N][N],mark[N],b[N],ls[N],rs[N],rnd[N],num[N],sum[N],c[N];
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;c......
阅读全文