We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
https://oi-wiki.org/ds/persistent-seg/
https://tioj.ck.tp.edu.tw/problems/1827
https://www.luogu.com.cn/problem/P2617
https://www.luogu.com.cn/problem/P2633
https://www.luogu.com.cn/problem/P3168
https://www.luogu.com.cn/problem/P3157
The text was updated successfully, but these errors were encountered:
I believe your content about this topic is not enough.
Sorry, something went wrong.
If it's possible, please use the problem on popular OJ instead of LOJ.
valderyaya
Successfully merging a pull request may close this issue.
持久化線段樹
引入
什麼是權值線段樹
什麼是持久化線段樹
回到題目
其他練習題
TIOJ 1827 Yet another simple task ^____^
洛谷 P2617 Dynamic Rankings
洛谷 P2633 Count on a tree
洛谷 P3168 [CQOI2015] 任务查询系统
洛谷 P3157 [CQOI2011]动态逆序对
References
https://oi-wiki.org/ds/persistent-seg/
https://tioj.ck.tp.edu.tw/problems/1827
https://www.luogu.com.cn/problem/P2617
https://www.luogu.com.cn/problem/P2633
https://www.luogu.com.cn/problem/P3168
https://www.luogu.com.cn/problem/P3157
The text was updated successfully, but these errors were encountered: