The activities of the organization of a need to use the n-a resource composed of a collection of activities S = (1, 2, ..., n), the resources can only be occupied by an activity. Each time i have to start s [i] and end times f [i], and s [i] <= f [i]. Once selected, activity i will occupy half-open time interval [s [i], f [i]). If [s [i], f [j]) and [s [i], f [j]) do not overlap each other, said the activities of i and j are compatible. Activities is to choose a compatible issue of the composition of the largest collections.

Packet : 107215766hdap.rar filelist
活动安排问题\student.dsw
活动安排问题\student.ncb
活动安排问题\student.plg
活动安排问题\STDAFX.H
活动安排问题\AFXIMPL.H
活动安排问题\WINHAND_.H
活动安排问题\OLEIMPL2.H
活动安排问题\CTLIMPL.H
活动安排问题\DBIMPL.H
活动安排问题\DAOIMPL.H
活动安排问题\SOCKIMPL.H
活动安排问题\student.dsp
活动安排问题\student.cpp
活动安排问题\student.opt
活动安排问题\Debug
活动安排问题

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．