Introduction - If you have any usage issues, please Google them yourself
The placement of Olympic signs: an advertising company in haidian district has been responsible for setting instructions for the people to watch the games in Beijing
Their specific task is to set up multiple signboards along the route from Beijing to the Olympic stadium in Beijing. Assuming that the north
There are D kilometers along the route to the Beijing Olympic stadium. The possible location of the indicator is x1, x2,... ,
Xn is given, so each xi is in the interval [0, D]. Of course, there are ads on the signboards besides location information
Information, suppose you put a sign on the site xi, the AD company will get the ri> So the benefit of 0.
However, the indicator cannot be placed arbitrarily, between the two signs, according to the ocog and Beijing municipal administration regulations
The relative distance must be greater than 5 km. Suppose you are CTO of the advertising agency, please design an algorithm to find it
A set of locations to place the signboard, which makes the total advertising revenue of the company reach the maximum under the above constraints.
Packet : 13898376guanggaopai.rar filelist
guanggaopai
guanggaopai\Debug
guanggaopai\DynScheme.cpp
guanggaopai\DynScheme.h
guanggaopai\main.cpp
guanggaopai\Question4.vcproj
guanggaopai\Question4.vcproj.LISHINKO.lxgangel.user
guanggaopai\UpgradeLog.XML
guanggaopai\_UpgradeReport_Files
guanggaopai\_UpgradeReport_Files\UpgradeReport.css
guanggaopai\_UpgradeReport_Files\UpgradeReport.xslt
guanggaopai\_UpgradeReport_Files\UpgradeReport_Minus.gif
guanggaopai\_UpgradeReport_Files\UpgradeReport_Plus.gif