Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

add 吉司机线段树 #1723

Closed
lushuyu opened this issue Sep 24, 2019 · 9 comments
Closed

add 吉司机线段树 #1723

lushuyu opened this issue Sep 24, 2019 · 9 comments
Labels
Duplicate / 重复 This issue or pull request already exists

Comments

@lushuyu
Copy link

lushuyu commented Sep 24, 2019

@welcome
Copy link

welcome bot commented Sep 24, 2019

感谢你对 OI Wiki 的关注!记得在 Issue 中表达清楚自己的意思哦~

@sshwy
Copy link
Member

sshwy commented Sep 24, 2019

https://oi-wiki.org/ds/seg-beats/
如果您有什么需要补充的欢迎开PR QvQ

OI Wiki 是一个编程竞赛知识整合站点,提供有趣又实用的编程竞赛知识以及其他有帮助的内容,帮助广大编程竞赛爱好者更快更深入地学习编程竞赛

@ouuan
Copy link
Member

ouuan commented Sep 24, 2019

这个标题很迷惑..我感觉我很久之前就提过这个问题。

@abc1763613206
Copy link
Member

@ouuan duplicate了?

@ouuan
Copy link
Member

ouuan commented Sep 24, 2019

这个 issue 证明了 “线段树 & 区间历史最值” 这个标题的确是迷惑的。

@ouuan
Copy link
Member

ouuan commented Sep 24, 2019

#1331 (comment)

@Marcythm
Copy link
Member

#1167 了解一下...?close 了吧

@lushuyu
Copy link
Author

lushuyu commented Sep 24, 2019

#1167 了解一下...?close 了吧

感谢,我看到了

@lushuyu lushuyu closed this as completed Sep 24, 2019
@lushuyu
Copy link
Author

lushuyu commented Sep 24, 2019

这个 issue 证明了 “线段树 & 区间历史最值” 这个标题的确是迷惑的。

OK 谢谢

@abc1763613206 abc1763613206 added the Duplicate / 重复 This issue or pull request already exists label Sep 25, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Duplicate / 重复 This issue or pull request already exists
Projects
None yet
Development

No branches or pull requests

5 participants