顺流而下,把梦做完
DFS问题。
落絮飞雁
数论
已知了最小费用流和最小割的性质,写写最大流的各种变体。
最小传输费用问题
Problem Description Once there was a special graph. Thi […]
Problem Description We all know that Bin-Laden is a not […]
Problem Description Most bicycle speedometers work by u […]
约翰又来折腾牛了……
牛头人约翰和牛的故事。
该来的总是会来的,写一道最头痛的网络流问题。