Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

这不就是一最大费用流吗?

Posted by number at 2005-09-19 12:37:45 on Problem 2047
In Reply To:怎么优化呀? Posted by:tigerhy1 at 2005-09-19 10:45:22

求两次最大费用可增广路,复杂度是2k(n+k),k表示一年的天数

Followed by:

哪个算法是 f*n*n 的？ (36) semonteer 2005-09-19 13:01:52
- dp (0) frkstyc 2005-09-19 13:06:34
  - Re:dp (22) tigerhy1 2005-09-19 20:17:38
- dp+线段树水过。 (0) yygy 2013-04-18 16:00:35

Post your reply here: