Dig or Climb

Dig or Climb

.
.
题意：给出一些山体，人可以用Vw的速度在表面行走，也可以用Vc的速度在山中严格水平的隧道通过，问最短的时间到达终点。
.
.
解法：首先要注意的是在水平的线上是不能打隧道的。我用了两个数组记录：一个是哪些点可以往后面的点进行挖隧道转移，显然只要不是山顶，即该点高度低于下一个点的高度（严格小于），可以挖隧道。一个是哪些点可以通过打隧道转移，明显对于该点高度大于等于前一个点的位置只能又前一个点的最短时间通过Vw走过来，而对于可以被前面的点转移的，就扫描哪些点可以转移过来。转移过程要记录允许的高度down~up，避免出现因为在天上挖隧道的非法情况。
.
.

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
using namespace std;

const int maXn = 2000;

struct Node {
    double X, Y;
}a[maXn];
int n, m;
double vw, vc, X, Y, X1, Y1, X2, Y2, dist, f[maXn], up, down;
bool flag[maXn] = {0}, g[maXn] = {0};

double sqr(int X) {
    return X*X;
}

double sqr(double X) {
    return X*X;
}

int main() {
    freopen("c.in","r",stdin);
    freopen("c.out","w",stdout);


    scanf("%d", &n);
    scanf("%lf %lf", &vw, &vc);
    /*flag[1] = true;
    g[1] = true;*/
    for (int i = 1; i <= n; i++) {
        scanf("%lf %lf", &a[i].X, &a[i].Y);
        /*if (i > 1) {
            if (a[i].Y <= a[i-1].Y) {
                flag[i] = true;
                flag[i-1] = false;
            }
            if (a[i].Y < a[i-1].Y) flag[i-1] = false;
            if (a[i].Y < a[i-1].Y) {
                g[i] = true;
                g[i-1] = false;
            }
        }*/
    }
    for (int i = 1; i < n; i++) if (a[i].Y < a[i+1].Y) flag[i] = true;
    for (int i = 2; i <= n; i++) if (a[i].Y < a[i-1].Y) g[i] = true;
    f[1] = 0;
    for (int i = 2; i <= n; i++) {
        if (!g[i] || a[i-1].Y == a[i].Y) {
            dist = sqrt(sqr(a[i].X-a[i-1].X)+sqr(a[i].Y-a[i-1].Y));
            f[i] = f[i-1]+dist/vw;
        } else {
            dist = sqrt(sqr(a[i].X-a[i-1].X)+sqr(a[i].Y-a[i-1].Y));
            f[i] = f[i-1]+dist/vw;
            up = a[i-1].Y;
            down = a[i].Y;
            for (int j = i-2; j >= 1; j--) if (flag[j]) {
                if (a[j].Y <= a[i].Y) {
                    X1 = a[j].X;
                    X2 = a[j+1].X;
                    Y1 = a[j].Y;
                    Y2 = a[j+1].Y;
                    Y = a[i].Y;
                    X = (Y-Y1)*(X2-X1)/(Y2-Y1)+X1;
                    f[i] = min(f[i], f[j]+(double(a[i].X)-X)*1.0/vc+sqrt(sqr(X-X1)+sqr(Y-Y1))/vw);
                    break;
                } else if (a[j].Y < up && a[j].Y >= down) {
                    X1 = a[i-1].X;
                    X2 = a[i].X;
                    Y1 = a[i-1].Y;
                    Y2 = a[i].Y;
                    Y = a[j].Y;
                    X = (Y-Y2)*(X1-X2)/(Y1-Y2)+X2;
                    f[i] = min(f[i], f[j]+(X-double(a[j].X))*1.0/vc+sqrt(sqr(X-X2)+sqr(Y-Y2))/vw);
                    up = a[j].Y;
                    if (up == down) break;
                }
            }
        }
    }
    printf("%.8lf\n", f[n]);    

}