POJ 3621 Sightseeing Cows 最优比率环

题意：给出一个有向图 找出一个环 使得环上 点权之和 / 边权之和 最大

最优比率环问题 二分答案 + SPFA判负环

至于如何建图  参考资料 http://blog.csdn.net/hhaile/article/details/8883652

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>

using namespace std;

const int MAXN = 1000 + 10;
const int MAXE = 10000 + 10;
const double INF = 10000000 + 10;
const double eps = 1e-5;

int head[MAXN];
int vis[MAXN];
int cnt[MAXN];
int STACK[MAXN];
double dist[MAXN];
int tol;
int n, m;
double node_va[MAXN];

struct Edge {
    int to;
    double v;
    int next;
} edge[MAXE];

void Add_Edge(int a, int b, double v) {
    edge[tol].to = b;
    edge[tol].v = v;
    edge[tol].next = head[a];
    head[a] = tol++;
}

bool SPFA(int start, double l) {
    int top = 0;
    for(int v = 0; v <= n; v++) {
        if(v == start) {
            STACK[top++] = v;
            vis[v] = true;
            dist[v] = 0;
            cnt[v]++;
        } else {
            vis[v] = false;
            dist[v] = INF;
            cnt[v] = 0;
        }
    }
    while(top) {
        int u = STACK[--top];
        vis[u] = false;
        for(int i = head[u]; i != -1; i = edge[i].next) {
            int to = edge[i].to;
            double w = l * edge[i].v - node_va[to];
            if(dist[to] > dist[u] + w) {
                dist[to] = dist[u] + w;
                if(!vis[to]) {
                    vis[to] = true;
                    STACK[top++] = to;
                    if(++cnt[to] > n) return false;
                }
            }
        }
    }
    return true;
}

int main() {
    while(scanf("%d%d", &n, &m) != EOF) {
        for(int i = 1; i <= n; i++)
            scanf("%lf", &node_va[i]);
        tol = 0;
        memset(head, -1, sizeof(head));
        for(int i = 1; i <= n; i++)
            Add_Edge(0, i, 0);
        for(int i = 0; i < m; i++) {
            int u, v;
            double d;
            scanf("%d%d%lf", &u, &v, &d);
            Add_Edge(u, v, d);
        }
        double l =  0, r = 1000;
        while(l + eps < r) {
            double m = (l + r) / 2;
            if(SPFA(0, m)) r = m;
            else l = m;
        }
        printf("%.2lf\n", l);
    }
    return 0;
}