n个顶点、m条边的无自环的加权有向图。求求平均权值最小的环路。
法一:二分+SPFA,法二:Karp算法
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define maxn 55
struct Edge{
int from,to;
db dist;
};
struct BellmanFord{ //顶点从0开始!!!
int n,m;
vector<Edge> edges;
vector<int> G[maxn];
bool inq[maxn]; //是否在队列中
db d[maxn]; //s到各个点的距离
int p[maxn]; //路径
int cnt[maxn]; //进队次数
void init(int n){
this->n=n;
for(int i=0;i<n;++i) G[i].clear();
edges.clear();
}
void AddEdge(int from,int to,db dist){
edges.push_back((Edge){from,to,dist});
m=edges.size();
G[from].push_back(m-1);
}
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;
inq[0]=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;
p[e.to]=G[u][i];
if(!inq[e.to]){
Q.push(e.to);
inq[e.to]=1;
if(++cnt[e.to]>n) return true;
}
}
}
}
return false;
}
};
BellmanFord B;
bool check(db x){
int i;
for(i=0;i<B.edges.size();++i) B.edges[i].dist-=x;
bool f=B.negativeCycle();
for(i=0;i<B.edges.size();++i) B.edges[i].dist+=x;
return f;
}
int main()
{
int ca,t,i,n,m;
cin>>t;
for(ca=1;ca<=t;++ca)
{
scanf("%d%d",&n,&m);
B.init(n);
int x,y;
db z,L=0,R=-1;
for(i=1;i<=m;++i){
scanf("%d%d%lf",&x,&y,&z);
--x,--y;
B.AddEdge(x,y,z);
R=max(R,z);
}
printf("Case #%d: ",ca);
if(!check(R+1)) puts("No cycle found.");
else{
while(R-L>1e-4){
db m=(L+R)/2;
if(check(m)) R=m;
else L=m;
}
printf("%.2lf\n",R);
}
}
return 0;
}