阅读背景:

HDU 1150 Machine Schedule (最小点覆盖)

来源:互联网 

Description

As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that must be satisfied and the type of schedule desired. Here we consider a 2-machine scheduling problem. As we all know, m



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

分享到: