bzoj1486(dfs版spfa判环)

 

01分数规划，注意这里是用dfs版的spfa判环，我们只需要判断是否可以进行一个圈的松弛操作就好。

 

#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<algorithm>
using namespace std;
const int N=10005;
 
int n,rt,m,flag;
 
struct aa
{
    int u,v;
    double dis;
}bian[10005];
 
 
 
int head[3005],tot;
struct aaa
{
    int to,pre;double dis;
}edge[N];
void addedge(int u,int v,double d)
{
    edge[++tot].to=v;edge[tot].pre=head[u];edge[tot].dis=d;head[u]=tot;
}
 
 
bool b[3005];
double dis[3005];
void dfs(int u)
{
    b[u]=true;
    for (int i=head[u];i;i=edge[i].pre)
    if (dis[edge[i].to]>dis[u]+edge[i].dis)
    {
        if (b[edge[i].to]) {flag=1;return;}
        dis[edge[i].to]=dis[u]+edge[i].dis;
        dfs(edge[i].to);
    }
    b[u]=false;
}
bool pan(double mid)
{
    tot=0;
    for (int i=1;i<=n;i++) head[i]=b[i]=0,dis[i]=0;
    for (int i=1;i<=m;i++) addedge(bian[i].u,bian[i].v,bian[i].dis-mid);
    flag=0;
    for (int i=1;i<=n;i++) 
    {
        dfs(i);if (flag) return true;
    }
    return false;
}
int main()
{
    scanf("%d%d",&n,&m);
    for (int i=1;i<=m;i++) 
        scanf("%d%d%lf",&bian[i].u,&bian[i].v,&bian[i].dis);    
    double l=-1e7,r=1e7,mid;
    while (l+1e-9<r)
    {
        mid=(l+r)/2;
        if (pan(mid)) r=mid;else l=mid;
    }
    printf("%.8lf",l);
    return 0;
}