UVA 11478 Halum(Bellman-Ford+差分约束系统)

白书题解写的很清楚了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=500+5;
const int maxc=2700+5;
struct edge{
    int to,dist;
};
struct BellmanFord{
    int n,m;
    edge edges[maxc];
    int head[maxn];
    int next[maxc];
    int d[maxn];
    int inq[maxn];
    int cnt[maxn];
    
    void init(int n){
        this->n=n;
        m=0;
        memset(head,-1,sizeof(head));
    }
    
    void addedge(int from,int to,int dist){
        next[m]=head[from];
        head[from]=m;
        edges[m++]=edge{to,dist};
    }
    
    bool negativeCycle(){
        queue<int> q;
        memset(inq,0,sizeof(inq));
        memset(cnt,0,sizeof(cnt));
        for(int i=0;i<n;i++) {d[i]=0;q.push(i);}
        while(!q.empty()){
            int u=q.front();q.pop();
            inq[u]=false;
            for(int i=head[u];i!=-1;i=next[i]){
                edge &e=edges[i];
                if(d[e.to]>d[u]+e.dist){
                    d[e.to]=d[u]+e.dist;
                    if(inq[e.to]==false) {q.push(e.to);inq[e.to]=true;if(++cnt[e.to]>n) return true;}
                }
            }
        }
        return false;
    }
};

BellmanFord solver;
bool test(int x){
    for(int i=0;i<solver.m;i++) solver.edges[i].dist-=x;
    bool ret=solver.negativeCycle();
    for(int i=0;i<solver.m;i++) solver.edges[i].dist+=x;
    return !ret;
}
int n,m;
int main()
{
    while(scanf("%d%d",&n,&m)==2)
    {
        solver.init(n);
        int up=0;
        for(int i=0;i<m;i++){
            int u,v,dist;
            scanf("%d%d%d",&u,&v,&dist);up=max(up,dist);
            solver.addedge(u-1,v-1,dist);
        }
        if(test(up+1)) printf("Infinite\n");
        else if(!test(1)) printf("No Solution\n");
        else{
            int l=2,r=up;
            int ans=1;
            while(l<=r){
                int mid=l+(r-l)/2;
                if(test(mid)) {ans=mid;l=mid+1;}else r=mid-1;
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}