电梯的调度算法

对于O(n)的算法，假设电梯停在第i层楼，显然可以计算出所有乘客总共要爬楼梯的层数Y，如果有N1个乘客目的在第i层楼一下，有N2个乘客在第i层楼，还有N3个乘客在第i层楼以上。此时，如果电梯停在i - 1层（从第一层开始考察），所有目的地在第i层及以上的乘客都要多爬一层，总共需要多爬N2 + N3层，而所有目的地在第i - 1层及一下的乘客可以少爬一层总共可以少爬N1层。因此总共需要爬的层数为Y-N1+（N2 + N3）= Y-(N1 - N2 - N3)层。

反之，（从第N层开始考察）如果电梯停在i + 1层，那么总共需要爬的层数为Y + （N1+ N2 - N3）。因此，当N1 > N2 + N3时，电梯在第i -1 层停更好，走的层数减少（N1 - N2 - N3）而当N1 + N2 < N3时，电梯停在 i + 1层更好，其它情况下，电梯停在第i层最好。

#include <iostream>
using namespace std;
//======复杂度为O(n平方)======
/*
int Person[] = {1, 1, 1, 9, 1};
int TargetFloor = -1;
int MinFloor;
int N = 5;
int nFloor;
*/
/*
void Min()
{
    for(int i = 1; i < N; ++i)
    {
        nFloor = 0;
        for(int j = 1; j < i; ++j)
        {
            nFloor += Person[j - 1] * (i - j);
        }
        for(int k = i + 1; k <= N; ++k)
        {
            nFloor += Person[k - 1] * ( k - i);
        }
        if(TargetFloor == -1 || MinFloor > nFloor)
        {
            MinFloor = nFloor;
            TargetFloor = i;
        }
    }
    cout << "It should stop at :" << endl;
    cout << TargetFloor << " Floor" << endl;
    cout << "The Min Floor is: " << endl;
    cout << MinFloor << endl;
}
*/

//=========复杂度为O(n)=========
int Person[] = {1, 1, 1, 9, 1};
int TargetFloor = 1;
int MinFloor = 0;
int N1;//第i层以下的总乘客数
int N2;//第i层的乘客数
int N3;//第i层以上的总乘客数
int i;
int N = 5;
//=========第一种方法===========
void Min1()
{
    for(N1 = 0, N2 = Person[N - 1], N3 = 0, i = N - 1; 1 <= i; --i)
    {
        N1 += Person[i - 1];
        MinFloor += Person[i - 1] *(N - i);
    }
    for(int j = N - 1; 1 <= j; --j)
    {
        if(N1 > N2 + N3)
        {
            TargetFloor = j;
            MinFloor -= (N1 - N2 - N3);
            N3 += N2;
            N2 = Person[j - 1];
            N1 -= Person[j - 1];
        }else
        break;
    }
    cout << "It should stop at :" << endl;
    cout << TargetFloor << " Floor" << endl;
    cout << "The Min Floor is: " << endl;
    cout << MinFloor << endl;
}

//========第二种方法=========
/*
void Min2()
{
    //在第一层时，对N1，N2，N3进行初始化
    for(N1 = 0, N2 = Person[0], N3 = 0, i = 2; i <= N; ++i )
    {
        N3 += Person[i];
        MinFloor += Person[i - 1] * (i - 1);
    }
    //从第二层开始逐层遍历若i + 1层符合条件则改变MinFloor和TargetFloor
    for(int j = 2; j < N; ++j)
    {
        if(N1 + N2 < N3)
        {
            TargetFloor = j;
            MinFloor += N1 + N2 - N3;
            N1 += N2;
            N2 = Person[j - 1];
            N3 -= Person[j - 1];

        }else
        break;
    }
    cout << "It should stop at :" << endl;
    cout << TargetFloor << " Floor" << endl;
    cout << "The Min Floor is: " << endl;
    cout << MinFloor << endl;
}
*/
int main()
{
    Min1();
    //Min2();
    return 0;
}