答案比正解少1,+1AC但是样例过不去

P4098 [HEOI2013] ALO

好臭,不想看了
by FZzzz @ 2020-05-21 20:23:39


@[FZzzz](/user/174045) 不要啊,就差了一个一个一个一个一个啊啊啊啊
by Episode9 @ 2020-05-21 20:24:49


好臭(
by DeepSkyBlue__ @ 2020-05-21 20:32:59


又臭又长 ~~lz再见~~
by 打表大蒟蒻 @ 2020-05-21 20:55:29


@[Voidstruct](/user/37409) 哇,线段树维护前驱后继,i了i了
by Limit @ 2020-05-21 20:57:18


我还以为只有我会这样写呢(
by Limit @ 2020-05-21 20:57:32


@[Limit](/user/86625) O_o
by Episode9 @ 2020-05-21 21:39:23


是insert的锅。。。
by Episode9 @ 2020-05-22 07:01:58


```cpp inline void insert(int pre,int &root,int i,int x) { root=++cnt; t[root]=t[pre]; t[root].size++; if (i<0) return; if ((x>>i)&1) insert(t[pre].rs,t[root].rs,i-1,x); else insert(t[pre].ls,t[root].ls,i-1,x); } ``` 这样就好了。。。不然0会挂
by Episode9 @ 2020-05-22 07:02:38


|