小飞的电梯调度算法
电梯是我们每天都要坐的,上班高峰期是非常拥挤的,大家都不想每层都停,决定选择一层停,剩下的楼层大家自己爬。假设电梯共有N层,坐电梯的人有M人,每个人都有自己的目的层,现在让你设计一个算法,快速算出了电梯停在哪一层,大家爬的楼层最少?
解题思路:
1.穷举法,遍历每一层大家爬的层数,找出最少的一层。
示例代码:
#include
using namespace std;
static const int LiftNums = 10;
static const int Passengers = 10;
static const int PassengerLifts[Passengers] = { 2,3,4,7,6,5,4,3,4,9};
//解法一:穷举法
void getMinLifts(const int liftNums, const int*passengerLifts, const int Passengernums)
{
int minLofts = 100000;
int lifts = 0;
// 遍历楼层
for (int i = 1; i < liftNums; ++i)
{
int lofts = 0;
for (int j = 0; j < Passengernums; ++j)
{
lofts += abs(passengerLifts[j] - i);
}
if (lofts < minLofts)
{
minLofts = lofts;
lifts = i;
}
}
std::cout << "停留的楼层为: " << lifts << " 大家一共需要爬楼层为: " << minLofts << std::endl;
}
int main(int agrc, char**argv)
{
getMinLifts(LiftNums,PassengerLifts, Passengers);
getchar();
return 0;
}
扩展:下楼肯定比上楼好,假设下1层消耗能量1单位,上1层楼2个单位。咋办?
void getMinLifts(const int liftNums, const int*passengerLifts, const int Passengernums)
{
int minLofts = 100000;
int lifts = 0;
// 遍历楼层
for (int i = 1; i < liftNums; ++i)
{
int lofts = 0;
for (int j = 0; j < Passengernums; ++j)
{
if (passengerLifts[j] - i > 0)
{
lofts += (passengerLifts[j] - i)*upfloor;
}
else
{
lofts += (passengerLifts[j] - i)*downfloor;
}
}
if (lofts < minLofts)
{
minLofts = lofts;
lifts = i;
}
}
std::cout << "停留的楼层为: " << lifts << " 大家一共需要爬楼层为: " << minLofts << std::endl;
}