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

最新推荐文章于 2025-02-11 15:02:51 发布

weixin_30755709

最新推荐文章于 2025-02-11 15:02:51 发布

阅读量289

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/suguoqiang/archive/2012/02/27/2369755.html

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