Server Load balancer 10817-Headmaster's headache (status compression DP)

From http://blog.csdn.net/shuangde800

Question link: Click the open link

Theme

A school has n teachers and M job seekers who know the salaries of each person and the set of courses they can teach. The minimum wage is required so that at least two teachers can teach each course. In-service teachers must be recruited.

Ideas

This question is not very good. It took a long time ..

F [S1] [s2]: S1 indicates that at least one instructor teaches the course set {S1.

S2 indicates that the course set {S2} has at least two instructors.

PI of each job seeker, for each job seeker, either or not, is the 01 backpack problem.

For S1 and S2, you can follow the courses of the currently enumerated job seekers to publish the next status:

Nexts1 = P [I] | S1,

Nexts2 = (P [I] & S1) | S2

F [nexts1] [nexts2] = min (F [nexts1] [nexts2], F [S1] [s2] + P [I])

Code