楼教主男人八题，告一段落

各位老板好，我是自在飞花。

细心的老铁可能发现了我没有讲第七题。

这个是因为第七题太难了。倒不是代码实现有多么难，而是把思路讲明白很难。

这个题的正解是 Garsia-Wachs 算法，一种在已知键值和查询概率的前提下，构造最优二叉搜索树的算法。

我大约想了三周了，也没想出比较易懂的讲解方式，又不想抄书，所以暂且放弃了，等哪天顿悟了再回来补上。

另外，我为大家找到了一个证明，很严谨也很晦涩，有兴趣的老铁可以看下 《The Art of Computer Programming》第3卷 6.2.2 节 Algorithm G 和 Lemma W，Lemma X，Lemma Y，Lemma Z。 [PDF下载链接]。(https://mp.weixin.qq.com/s/wTkvRxgcGnQyQ3fCrgtQqA)

好了，接下来进入第八题，POJ 1744 《Elevator Stopping Plan》。

题目链接

http://poj.org/problem?id=1744

题目描述

There are H floors in GaoKe Hall.

It takes 4 seconds for the elevator to raise one floor. It means: It costs $(n-1)\ast 4$ seconds if the elevator goes from the 1 st floor to the nth floor without stop. And the elevator stops 10 second once.

So, if the elevator stops at each floor, it will cost $(n-1)\ast 4+(n-2)\ast 10$ seconds (It is not necessary to calculate the stopping time at nth floor).

In another way, it takes 20 seconds for the workers to go up or down one floor. It takes $(n-1)\ast 20$ seconds for them to walk from the 1 st floor to the nth floor.

After thinking over for a long time, Hal finally found a way to improve this situation. He told the elevator man his idea:

First, the elevator man asks the people which floors they want to go. He will then design a stopping plan which minimize the time the last person need to arrive the floor where his office locates.

For example, if the elevator is required to stop at the 4th , 5th and 10th floor, the stopping plan would be: the elevator stops at 4th and 10th floor. Because the elevator will arrive 4 th floor at $3\ast 4=12$ second, then it will stop 10 seconds, then it will arrive 10 th floor at $3\ast 4+10+6\ast 4=46$ second. People who want to go 4 th floor will reach their office at 12.

Second, people who want to go to 5 th floor will reach at $12+20=32$ second and people who want to go to 10 th floor will reach at 46 second. Therefore it takes 46 seconds for the last person to reach his office. It is a good deal for all people.

Now, you are supposed to write a program to help the elevator man to design the stopping plan,which minimize the time the last person needs to arrive at his floor.

题目输入

The input consists of several test cases. Each test case is in a single line as the following:
$$n{f}_1{f}_2...f_n$$

It means, there are totally n floors at which the elevator need to stop, and n = 0 means no testcases
any more.

f1 f2 … fn are the floors at which the elevator is to be stopped (1<=n<=30000, 2<= f1< f2 … fn<=30000).

Every number is separated by a single space.

题目输出

For each testcase, output the time the last reading person needs in the a single line

输入样例

3 4 5 10
1 2
0

输出样例

46
4

一般看到最大的最小值，最早的最晚时间点等类似字眼，都可考虑用二分来解决。

对于给定的输入，必定存在一个最优解，假设该最优解消耗 $t$ 秒。那么对于任意的时间限制 $t^{\prime }\ge t$，都存在解决方案。对于任意$t^{\prime \prime }<t$，都不可能存在解决方案(不然 $t$ 就不是最优解了)。

不难发现，这符合二分的前提——的单调性。那么问题变成了，在给定的输入上，判断在 $mid$ 秒内能否将所有人送至指定楼层。如果存在，则说明 $t\le mid$，反之说明$t>mid$。接下来，我们将这个存在性问题转化为区间覆盖问题来解决。

不妨先假设，在最优方案中，电梯有 $S$ 个停靠点，第 $i$ 停靠点的楼层为 $F_i$，停靠该楼层的时间点为 $T_i$。因为初始时电梯在第一层，不妨设 $F_0=1,T_0=0$。

我们让每个停靠点都覆盖区间 $[L_i,R_i]$ 内的所有楼层。覆盖的含义是：员工在 $T_i$ 时刻，在$F_i$ 走下电梯，可以在 $mid-T_i$ 秒内步行至 $[L_i,R_i]$ 中的任意一层。不难得出:

• $L_i=F_i-\lfloor (mid-T_i)/20\rfloor$
• $R_i=F_i+\lfloor (mid-T_i)/20\rfloor$

因为所有员工都必须在 $mid$ 时间内到达各自的楼层，所以这 $S$ 个停靠点要覆盖输入的 $f_1,f_2,...f_n$。

那么问题变成了构造$F_i$，$T_i$，$L_i$，$R_i$。接着使用贪心的思路来构造：

• 让每个区间尽可能的长——这是的$S$尽可能小，即停靠带来的时间花费更小。
• 任意两个区间没有交集——有交集意味着浪费。

首先，易得 $L_0=1$，$R_0=\lfloor \frac{mid}{20}\rfloor +1$。接着可在已知 $(F_{i-1},T_{i-1},L_{i-1},R_{i-1})$ 的前提下，求解 $(F_i,T_i,L_i,R_i)$。

因为要覆盖所有的 $f_1,f_2,...f_n$，那么第一个大于 $R_{i-1}$ 的 $f_x$ 就是 $L_i$，则有：

$$L_i=f_x$$

基于 $F_{i-1}$ 以及 $L_i$ 列出不等式如下：

$$10+4(F_i-F_{i-1})+20(F_i-L_i)+T_{i-1}\le mid$$

移项得：

$$24F_i\le mid+4F_{i-1}+20L_i-10-T_{i-1}$$

取最大值：

$$F_i=\lfloor \frac{mid+4F_{i-1}+20L_i-10-T_{i-1}}{24}\rfloor$$

易得：

• $T_i=T_{i-1}+10+4(F_i-F_{i-1})$
• $R_i=F_i+\lfloor \frac{mid-T_i}{20}\rfloor$

如上所述，只要能构造出停靠点，就说明$t\le mid$，否则 $t>mid$。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <math.h>
#include <map>
#include <set>
#include <vector>

using namespace std;

int f[30000];

bool check(int mid, int n) {
  int f0 = 1, t0 = 0, l0 = 1, r0 = mid/20 + 1;
  int i = 0;
  int stop_cost = 0;
  while (i < n) {
    // 寻找 fx
    while (f[i] <= r0) {
      i++;
    }
    if (i < n) {
      int l1 = f[i];
      int f1 = (mid+4*f0+20*l1-stop_cost-t0)/24;
      int t1 = t0 + stop_cost + (f1-f0)*4;
      int r1 = f1 + (mid-t1)/20;
      // 剩下的时间不足了
      if (f1 == f0) {
        return false;
      }
      stop_cost = 10;
      l0 = l1, r0 = r1, t0 = t1, f0 = f1;
    }
  }
  return true;
}

int main() {
  int n;
  while(scanf("%d", &n) && n) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &f[i]);
    }
    int L = (f[n-1]-1)*4, R = (f[n-1]-1)*10;

    while(L <= R) {
      int mid = (L+R)>>1;
      if (check(mid, n)) {
        R = mid-1;
      } else {
        L = mid+1;
      }
    }
    printf("%d\n", R+1);
  }
  return 0;
}