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

图论 | Ptilopsis_w's little blog #22

Open
Ptilopsisw opened this issue Aug 22, 2022 · 3 comments
Open

图论 | Ptilopsis_w's little blog #22

Ptilopsisw opened this issue Aug 22, 2022 · 3 comments

Comments

@Ptilopsisw
Copy link
Owner

https://ptilopsisw.github.io/2022/08/17/%E5%9B%BE%E8%AE%BA/#%E4%BC%98%E5%8C%96%E5%BB%BA%E5%9B%BE

并查集这个没什么好讲的,带权和扩展域相信大家都会,这里就给一道有意思的题吧 link 这个题并查集显然不能直接做,因为修改一个节点也会影响它的儿子,我们要想办法对他儿子的影响给去掉。 于是我们可以借鉴扩展域并查集的思想,新开一倍的节点,用 i+n 来代表合并并查集时用的节点,这样我们修改 i 时,不会影响 i+n 的父亲,达到了单点修改的目的。 二分图二分图最大匹配貌似大家只会敲dinic的样子,

@Jekyll-Y
Copy link

Standing on the Shoulder of Giants

@Jekyll-Y
Copy link

🤔

@Jekyll-Y
Copy link

🙈 🙉 🙊

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants