蒟蒻求助 TLE on #29

CF487E Tourists

@[AlphaZe](/user/186860) 线段树数组小了,要开到5e5,nex和ver不用开到6e5,同样2e5就行
by _maze @ 2022-10-22 12:00:22


@[_maze](/user/149219) 还是TLE…
by AlphaZe @ 2022-10-22 14:29:02


我再看看。。。
by _maze @ 2022-10-22 14:30:13


@[AlphaZe](/user/186860) 线段树查询应该是区间查询吧,但你的代码中却搞成了一个一个拆开的单点查询
by _maze @ 2022-10-22 14:44:47


```cpp int query(int now, int l, int r) { if (nd[now].l >= l && r >= nd[now].r) { return nd[now].mi; } int mid = (nd[now].l + nd[now].r) >> 1; if (r <= mid) return query(now << 1, l, r); else if (l > mid) return query(now << 1 | 1, l, r); else return min(query(now << 1, l, mid), query(now << 1 | 1, mid + 1, r)); } ```
by _maze @ 2022-10-22 14:46:12


改成这样就能过了
by _maze @ 2022-10-22 14:46:27


@[_maze](/user/149219) 谢谢大佬%%%
by AlphaZe @ 2022-10-22 15:11:17


|