Durancer @ 2021-02-16 22:10:41
这是#7RE的定义顺序
const int N=1e5+9;
const int M=1e7+9;
const int inf=2e9+9;
struct node{
int last;
int to;
int dis;
}e[N<<1];
int maxp[N],size[N],rem[N];
int q[N],judge[M],query[1009],test[M];
int head[N],cnt;
int sum,n,m;
int vis[N];
int rt,dis[N];
换成这样就对了?
const int N=1e5+9;
const int M=1e7+9;
const int inf=2e9+9;
struct node{
int last;
int to;
int dis;
}e[N<<1];
int n,m;
int head[N],cnt;
int maxp[N],size[N],dis[N],rem[N];
int vis[N],test[M],judge[M],q[N];
int query[1009];
int sum,rt;
by w23c3c3 @ 2021-02-16 22:11:31
@Chen_怡 数组越界了吧
数组越界可能会访问到之后的内存/xia
by blank_space @ 2021-02-17 20:01:48
@Chen_怡 对于
by Durancer @ 2021-02-17 20:02:29
@blank_space !???
by blank_space @ 2021-02-17 20:05:29
@Chen_怡 很扯 但是很真实