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 最大费用可行流 #2366

Closed
FengZhg opened this issue Jul 3, 2020 · 3 comments
Closed

add 最大费用可行流 #2366

FengZhg opened this issue Jul 3, 2020 · 3 comments
Labels
Content Request / 内容请求 New feature or request help wanted / 需要帮助 Extra attention is needed

Comments

@FengZhg
Copy link

FengZhg commented Jul 3, 2020

我希望能添加的内容是

最大费用可行流

我了解到的相关参考资料有

https://blog.csdn.net/yo_bc/article/details/72877059?utm_source=blogxgwz0
实际上就跟费用流差了一行,并且最小费用可行流无意义。只有最大费用可行流

@FengZhg FengZhg added Content Request / 内容请求 New feature or request help wanted / 需要帮助 Extra attention is needed labels Jul 3, 2020
@welcome
Copy link

welcome bot commented Jul 3, 2020

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

@Nanarikom
Copy link
Contributor

反对。这不构成单独的知识点,最多只能作为一个例题。

@alphagocc
Copy link
Contributor

alphagocc commented Aug 12, 2023

根据
https://oi-wiki.org/intro/what-oi-wiki-is-not/#oi-wiki-%E4%B8%8D%E6%98%AF%E6%9D%83%E5%A8%81%E6%9C%BA%E6%9E%84
OI Wiki 不是百科全书

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

@alphagocc alphagocc closed this as not planned Won't fix, can't repro, duplicate, stale Aug 12, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Content Request / 内容请求 New feature or request help wanted / 需要帮助 Extra attention is needed
Projects
None yet
Development

No branches or pull requests

3 participants