编程之美：小飞的电梯调度算法

#include <iostream>
#include <string>
using namespace std;


int main(void)
{
int N;
cout << "输入楼层数N" << endl;
cin >> N;
int *pPerson = new int[sizeof(int) * (N + 1)];//每层有多少人
int temp;
int stopFloor = 0;//电梯停在第stopFloor层
int minFloor = 0x7fffffff;//所有乘客爬楼梯的层数之和的最小值
int floorNumber = 0;//乘客爬楼梯的总和
int thisFloorPerson, upFloorPerson, downFloorPerson;//电梯停在第stopFloor层，thisFloorPerson表示本层乘客数量，upFlooPerson表示位于stopFloor层以上的乘客数量


for (int i = 0; i <= N; i++){//每层的人数先置为0
pPerson[i] = 0;
}
while (cin >> temp){//输入要上的楼层，直到遇到EOF为止
if (temp > 0 && temp <= N){
pPerson[temp]++;
}
}
cin.clear();
//从第一层开始,电梯停在一层时，乘客需要爬楼梯层数的总和
stopFloor = 1;
thisFloorPerson = pPerson[1];
downFloorPerson = 0;
upFloorPerson = 0;
for (int i = 2; i <= N; i++){//求一层之上乘客的数量
upFloorPerson += pPerson[i];
}
floorNumber = 0;
for (int i = 2; i <= N; i++){//如果电梯停在1层的话，所有乘客爬楼梯层数的总和
floorNumber = floorNumber + pPerson[i] * (i - 1);
}
cout << "i = " << 1 << " floorNumber = " << floorNumber << endl;
if (floorNumber < minFloor){
minFloor = floorNumber;
stopFloor = 1;
}
/****************************************************************************************************************
计算从第二层开始，求电梯停在各层时，所有乘客爬楼梯层数的总和
利用楼层间的关系：
如果电梯停在第i层，所有乘客爬楼梯层数的总和为floorNumber
那么电梯停在第i+1层时，所有乘客爬楼梯层数的总和为floorNumber + thisFloorPerson + downFloorPerson - upFloorPerson
电梯停在第i+1层，更新thisFloorPerson，downFloorPerson，upFloorPerson的值
*****************************************************************************************************************/
for (int i = 2; i <= N; i++){
floorNumber = floorNumber + downFloorPerson + thisFloorPerson - upFloorPerson;
cout << "i = " << i << " floorNumber = " << floorNumber << endl;
downFloorPerson = downFloorPerson + pPerson[i - 1];
upFloorPerson = upFloorPerson - pPerson[i];
thisFloorPerson = pPerson[i];

if (floorNumber < minFloor){
minFloor = floorNumber;
stopFloor = i;
}
}
cout << "stopFloor = " << stopFloor << endl
<< "minFloor = " << minFloor << endl;


return 0;
}