MIT麻省理工学院 算法导论公开课Problem Set 6 solution.pdf

Introduction to Algorithms November 18, 2005 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik D. Demaine and Charles E. Leiserson Handout 24 Problem Set 6 Solutions Problem 6-1. Electronic Billboard You are starting a new Electronic Billboard company called E-Bill. For now, you have just one billboard and you can display one advertisement on the billboard at a time. Your advertising contract with the customers says that if you display their advertisement for one week, then they will pay you, otherwise they won’t. Customers come to you with their advertisements at arbitrary times and offer you some money to display their ad. When they come to you, you must decide immediately whether you will display their advertisement starting immediately. If you are already displaying some other advertisement, you may drop it and lose all the profit due to the dropped ad. The goal is to device an algorithm to maximize your profit. Formally, an advertisement arrives at time
 and has a profit of   . Upon arrival of an ad, the algorithm must decide immediately whether to display it or not. The algorithm receives the profit   of ad arriving at time
 only if it displays the ad from time
 up to
  . Assume that only one job arrives at a time. Assume also that if ad completes at time  , the billboard can start displaying another ad immediately. Consider the following algorithm AD -SCHEDULE , where   is some constant. When an ad with profit   arrives, 1. if no ad is being displayed, then start displaying , 2. if an ad  of profit   is being displayed, then discard  if and only if      , otherwise don’t accept . The ads that an algorithm displays for a ful