測試數據是否越界。
struct node{
int & operator[](int idx){
if(idx>=maxn||idx<0)while(1);
return a[idx];
}
int operator[](int idx)const{
if(idx>=maxn||idx<0)while(1);
return a[idx];
}
int a[maxn];
}lson,rson,va,dis,fa;
擴棧
int size = 512 << 20;
char *p = (char*)malloc(size) + size;
__asm__("movl %0, %%esp\n" :: "r"(p));
讀入掛
int read(){
int ans=0; char last=' ',ch=getchar();
while(ch<'0' || ch>'9')last=ch,ch=getchar();
while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
if(last=='-')ans=-ans; return ans;
}
輸出掛
inline void write(int x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
隨機數種子
srand((ll)time(NULL));