阅读背景:

HDU 4971 A simple brute force problem. 最小割 最大权闭合

来源:互联网 

题目描述:

Description
There’s a company with several projects to be done. Finish a project will get you profits. However, there are some technical problems for some specific projects. To solve the problem, the manager will train his employee which may cost his budget. There may be dependencies between technical problems, for example, A requires B means you need to solve problem B before solving problem A. If A requires B and B requires A, it means that you should solve them at the same time. You can select which problems to be solved and how to solve them freely before finish your projects. Can you tell me the maximum profit? There’s a company with




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: