玄学MLE

P1967 [NOIP2013 提高组] 货车运输

```cpp ans=min(ans,query(id[x]+1,id[y],1,n,1)); ``` 改成 ```cpp if (id[x]!=id[y]) ans=min(ans,query(id[x]+1,id[y],1,n,1)); ```
by Llf0703 @ 2019-05-01 12:28:08


@[Hale](/space/show?uid=74900)
by Llf0703 @ 2019-05-01 12:28:16


@[Hale](/space/show?uid=74900) ~~本蒟蒻:我看您开了一堆数组,怎么可能不被MLE呢……~~
by CHENRUIJIE @ 2019-05-01 12:50:24


@[Hale](/space/show?uid=74900) Orz树剖
by Kubic @ 2019-05-01 13:16:34


@[CHENRUIJIE](/space/show?uid=108875) 树刨就得开一堆数组啊
by Hale @ 2019-05-01 20:11:34


@[Llf0703](/space/show?uid=29696) 好的好的,改过来了,谢谢大佬 ORZ
by Hale @ 2019-05-01 20:11:54


@[Hale](/space/show?uid=74900) TQL
by CHENRUIJIE @ 2019-05-01 20:41:24


|