Fixing the Great Wall

Fixing the Great Wall

.
.
题意：给出n个坑，个人移动速度v（每秒），初始位置s，以及n个坑的状态，包括位置，初始损毁程度以及每秒增加的损毁程度，要求你去修补所有坑，使得总代价最小，修补不需要花费时间
.
.
解法：dp。f[i][j][0/1]表示当前状态，修了初始位置左边i个，右边j个，当前位置处于左（右）的最小代价，转移只会转移到f[i+1][j]和f[i][j+1]所以转移时间是O（1）的，时间复杂度是n^2。增量就是移动的时间乘当前状态下所有未修补的坑的增量，可以用前缀和来快速求解，最后注意用实数类型，向下取整。
.
.

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

const int maxn = 1010;
double f[maxn][maxn][2], a[maxn][3], b[maxn][3], suma[maxn] = {0}, sumb[maxn] = {0};
bool flag[maxn][maxn];
int n, a1, b1, x, y, z;
double s, v;

void kp(int i, int j) {
    int p = i, q = j;
    int mid = a[(p+q)/2][0];
    while (1) {
        while (a[p][0] > mid) p++;
        while (a[q][0] < mid) q--;
        if (p <= q) {
            swap(a[p], a[q]);
            p++; q--;
        }
        if (p > q) break;
    }
    if (i < q) kp(i, q);
    if (p < j) kp(p, j);
}

void kp2(int i, int j) {
    int p = i, q = j;
    int mid = b[(p+q)/2][0];
    while (1) {
        while (b[p][0] < mid) p++;
        while (b[q][0] > mid) q--;
        if (p <= q) {
            swap(b[p], b[q]);
            p++; q--;
        }
        if (p > q) break;
    }
    if (i < q) kp2(i, q);
    if (p < j) kp2(p, j);
}

int main() {
    //freopen("e.in","r",stdin);

    while (scanf("%d %lf %lf", &n, &v, &s) != EOF) {
        if (n == 0 && v == 0 && s == 0) break;
        memset(f, 0, sizeof(f));
        memset(flag, 0, sizeof(flag));
        a1 = 0;
        b1 = 0;
        for (int i = 1; i <= n; i++) {
            cin >> x >> y >> z;
            if (y > 0) {
                f[0][0][0] += y;
                f[0][0][1] += y;
            }
            if (x < s) {
                a[++a1][0] = x;
                a[a1][1] = y;
                a[a1][2] = z;
            } else if (x > s) {
                b[++b1][0] = x;
                b[b1][1] = y;
                b[b1][2] = z;
            }
        }
        flag[0][0] = true;
        a[0][0] = s;
        b[0][0] = s;
        if (a1 > 0) {
            kp(1, a1);
            suma[0] = 0;
            for (int i = 1; i <= a1; i++) suma[i] = suma[i-1]+a[i][2];
        }
        if (b1 > 0) {
            kp2(1, b1);
            sumb[0] = 0;
            for (int i = 1; i <= b1; i++) sumb[i] = sumb[i-1]+b[i][2];
        }
        for (int i = 0; i <= a1; i++)
            for (int j = 0; j <= b1; j++) if (flag[i][j]) {
                if (i+1 <= a1) {
                    if (!flag[i+1][j]) {
                        flag[i+1][j] = true;
                        f[i+1][j][0] = min(f[i][j][0]+(a[i][0]-a[i+1][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j]),
                                           f[i][j][1]+(b[j][0]-a[i+1][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j]));
                        f[i+1][j][1] = min(f[i][j][0]+(a[i][0]-a[i+1][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])+(b[j][0]-a[i+1][0])/v*(suma[a1]-suma[i+1]+sumb[b1]-sumb[j]),
                                           f[i][j][1]+(b[j][0]-a[i+1][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])+(b[j][0]-a[i+1][0])/v*(suma[a1]-suma[i+1]+sumb[b1]-sumb[j]));
                    } else {
                        f[i+1][j][0] = min(f[i+1][j][0],
                                       min(f[i][j][0]+(a[i][0]-a[i+1][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j]),
                                           f[i][j][1]+(b[j][0]-a[i+1][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])));
                        f[i+1][j][1] = min(f[i+1][j][1],
                                       min(f[i][j][0]+(a[i][0]-a[i+1][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])+(b[j][0]-a[i+1][0])/v*(suma[a1]-suma[i+1]+sumb[b1]-sumb[j]),
                                           f[i][j][1]+(b[j][0]-a[i+1][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])+(b[j][0]-a[i+1][0])/v*(suma[a1]-suma[i+1]+sumb[b1]-sumb[j])));
                    }
                }
                if (j+1 <= b1) {
                    if (!flag[i][j+1]) {
                        flag[i][j+1] = true;
                        f[i][j+1][0] = min(f[i][j][0]+(b[j+1][0]-a[i][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])+(b[j+1][0]-a[i][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j+1]),
                                           f[i][j][1]+(b[j+1][0]-b[j][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])+(b[j+1][0]-a[i][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j+1]));
                        f[i][j+1][1] = min(f[i][j][0]+(b[j+1][0]-a[i][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j]),
                                           f[i][j][1]+(b[j+1][0]-b[j][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j]));
                    } else {
                        f[i][j+1][0] = min(f[i][j+1][0],
                                       min(f[i][j][0]+(b[j+1][0]-a[i][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])+(b[j+1][0]-a[i][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j+1]),
                                           f[i][j][1]+(b[j+1][0]-b[j][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])+(b[j+1][0]-a[i][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j+1])));
                        f[i][j+1][1] = min(f[i][j+1][1],
                                       min(f[i][j][0]+(b[j+1][0]-a[i][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j]),
                                           f[i][j][1]+(b[j+1][0]-b[j][0])/v*(suma[a1]-suma[i]+sumb[b1]-sumb[j])));
                    }
                }
            }
        printf("%.0lf\n", floor(min(f[a1][b1][0], f[a1][b1][1])));
    }

}