UVA11478-Halum（BellmanFord + 差分约束）

题目链接

http://acm.hust.edu.cn/vjudge/problem/34651

思路

要求所有边的最小值最大， 可以二分答案，令所有边的权值均不小于x，对每条边a->b，其作用有：sum(a) - sum(b)。于是最后边的权值为sum(a) - sum(b) + w(a, b) ≥ x。即sum(b) - sum(a) ≤ w(a, b) - x，对所有的边都有这样的关系，于是得到了一个差分约束系统
对形如x - y ≤ b的式子，建立一条边y -> x，边的权值即为b。
最后对整张图求是否有负环，有负环则无解（可自行证明）

代码

#include<bits/stdc++.h>

using namespace std;

const int maxn = 505;
struct Edge {
    int from, to, dist;
    Edge(int a, int b, int c) : from(a), to(b), dist(c) {

    }
};

struct BellmanFord {
    int n, m;
    std::vector<Edge> edges;
    std::vector<int> G[maxn];
    int cnt[maxn], d[maxn];
    bool inq[maxn];

    void init(int n) {
        this->n = n;
        for (int i = 1; i <= n; i++) G[i].clear();
        edges.clear();
    }

    void addedge(int u, int v, int w) {
        edges.push_back(Edge(u, v, w));
        m = edges.size();
        G[u].push_back(m - 1);
    }

    bool negative_circle() {
        memset(cnt, 0, sizeof(cnt));
        memset(inq, 0, sizeof(inq));
        queue<int> Q;
        for (int i = 1; i <= n; i++) {
            d[i] = 0;
            inq[1] = 1;
            Q.push(i);
        }
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            inq[u] = 0;
            for (int i = 0; i < G[u].size(); i++) {
                Edge &e = edges[G[u][i]];
                if (d[e.to] > d[u] + e.dist) {
                    d[e.to] = d[u] + e.dist;
                    if (!inq[e.to]) {
                        Q.push(e.to);
                        inq[e.to] = 1;
                        if (++cnt[e.to] > n) return true;
                    }
                }
            }
        }
        return false;
    }
};

BellmanFord solver;
bool judge(int x) {
    for (int i = 0; i < solver.m; i++) solver.edges[i].dist -= x;
    bool res = solver.negative_circle();
    for (int i = 0; i < solver.m; i++) solver.edges[i].dist += x;
    return res;
}

int main() {
    //freopen("in.txt", "r", stdin);
    int n, m;
    while (~scanf("%d%d", &n, &m)) {
        solver.init(n);
        for (int i = 0; i < m; i++) {
            int x, y, z;
            scanf("%d%d%d", &x, &y, &z);
            solver.addedge(x, y, z);
        }
        if (!judge(10005)) {
            puts("Infinite");
            continue;
        }
        if (judge(1)) {
            puts("No Solution");
            continue;
        }
        int L = 1, R = 10000, M;
        while (L < R) {
            if (R == L + 1) {
                if (judge(R)) M = L;
                else M = R;
                break;
            } else {
                M = (L + R) >> 1;
                if (judge(M)) R = M;
                else L = M;
            }
        }
        printf("%d\n", M);
    }
    return 0;
}