bzoj 1003 [ZJOI2006]物流运输 dp+spfa

题面

题目传送门

解法

设$f_i$表示在第$i$天时的最小代价
可以先预处理出$g_{i,j}$，表示在第$i$天到第$j$天时$1$到$n$的最短路
所以，$f_i=min(f_j+k+g_{j+1,i}×(i-j))$

代码

#include <bits/stdc++.h>
#define N 210
using namespace std;
template <typename node> void read(node &x) {
    x = 0; int f = 1; char c = getchar();
    while (!isdigit(c)) {if (c == '-') f = -1; c = getchar();}
    while (isdigit(c)) x = x * 10 + c - '0', c = getchar(); x *= f;
}
struct Edge {
    int next, num, v;
} e[N * N];
long long n, m, k, t, cnt, f[N], dis[N], used[N], ban[N][N], g[N][N];
void add(int x, int y, int v) {
    e[++cnt] = (Edge) {e[x].next, y, v};
    e[x].next = cnt;
}
int spfa(int l, int r) {
    memset(f, 0, sizeof(f));
    for (int i = 1; i <= n; i++)
        for (int j = l; j <= r; j++)
            if (ban[i][j]) {f[i] = true; break;}
    memset(dis, 0x3f, sizeof(dis));
    memset(used, 0, sizeof(used));
    dis[1] = 0, used[1] = 1;
    queue <int> q; q.push(1);
    while (!q.empty()) {
        int x = q.front(); q.pop(); used[x] = 0;
        for (int p = e[x].next; p; p = e[p].next) {
            int k = e[p].num, v = e[p].v;
            if (dis[k] > dis[x] + v && !f[k]) {
                dis[k] = dis[x] + v;
                if (!used[k]) q.push(k), used[k] = 1;
            }
        }
    }
    return dis[n];
}
int main() {
    read(t), read(n), read(k), read(m); cnt = n;
    for (int i = 1; i <= m; i++) {
        int x, y, v;
        read(x), read(y), read(v);
        add(x, y, v), add(y, x, v);
    }
    int d; read(d);
    for (int i = 1; i <= d; i++) {
        int x, l, r;
        read(x), read(l), read(r);
        for (int j = l; j <= r; j++)
            ban[x][j] = 1;
    }
    for (int i = 1; i <= t; i++)
        for (int j = i; j <= t; j++)
            g[i][j] = spfa(i, j);
    memset(f, 0x3f, sizeof(f)); f[0] = -k;
    for (int i = 1; i <= t; i++)
        for (int j = 0; j < i; j++)
            f[i] = min(f[i], f[j] + k + g[j + 1][i] * (i - j));
    cout << f[t] << "\n";
    return 0;
}