编程之美——楼梯调度算法

#include "stdlib.h"
#include
#include<string>
#include
void b(int nPerson[7])// nPerson[i]表示到第i层的乘客数目
{
int nFloor, nMinFloor, nTargetFloor;
nTargetFloor &＃61; -1;
for(int i &＃61; 1; i <&＃61; 6; i&＃43;&＃43;)
{
nFloor &＃61; 0;
int j;
for(j &＃61; 1; j nFloor &＃43;&＃61; nPerson[j] * (i - j);
for(j &＃61; i &＃43; 1; j <&＃61; 6; j&＃43;&＃43;)
nFloor &＃43;&＃61; nPerson[j] *(j - i);
cout<<"第"<"层楼停"<<" 总要走的楼层是"<if(nTargetFloor &＃61;&＃61; -1 || nMinFloor > nFloor)
{
nMinFloor &＃61; nFloor;
nTargetFloor &＃61; i;
}
}
cout<<"最优方案是在第"<"层楼停&＃xff0c;只需走"<"层"<}
void main()
{
int a[7];
cout<<"请输入各层楼的人数:";
for(int i&＃61;1;i<7;i&＃43;&＃43;)
cin>>a[i];
b(a);
}