BZOJ1486: [HNOI2009]最小圈

分数规划
二分答案，所有边减答案后判有没有负环，有的话说明答案不大于当前二分值
判负环似乎卡SPFA判入队n次，用dfs版的SPFA判负环
题目要保留8位，所以要调一下精度

---

code：

#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;

const double eps = 1e-9;
const int inf=1e7+10;
const int maxn = 3100;
const int maxm = 11000;
struct edge
{
    int y,nex;
    double c;
    edge(){}
    edge(int _y,double _c,int _nex){y=_y;c=_c;nex=_nex;}
}a[maxm]; int len,fir[maxn];
int n,m;
int xy[maxm][2];
double e[maxm];
void ins(int x,int y,double c){a[++len]=edge(y,c,fir[x]);fir[x]=len;}

bool vis[maxn];
double dis[maxn];
bool dfs(int x)
{
    vis[x]=true;
    for(int k=fir[x];k;k=a[k].nex)
    {
        int y=a[k].y;
        if(dis[y]>dis[x]+a[k].c)
        {
            dis[y]=dis[x]+a[k].c;
            if(vis[y]) return true;
            if(dfs(y)) return true;
        }
    }
    vis[x]=false;
    return false;
}
bool judge(double x)
{
    memset(fir,0,sizeof fir); len=0;
    for(int i=1;i<=m;i++) ins(xy[i][0],xy[i][1],e[i]-x);
    for(int i=1;i<=n;i++) vis[i]=false,dis[i]=0.0;
    for(int i=1;i<=n;i++)
    {
        if(dfs(i)) return true;
    }
    return false;
}

int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int x,y;double c; scanf("%d%d%lf",&x,&y,&c);
        xy[i][0]=x; xy[i][1]=y; e[i]=c;
    }
    double l=-inf,r=inf;
    while(r-l>eps)
    {
        double mid=(l+r)/2;
        if(judge(mid)) r=mid-eps;
        else l=mid+eps;
    }
    printf("%.8lf\n",r+eps);

    return 0;
}