题意
题解
二分答案,问题转化为判定满足图中存在一个环,满足下式的最大的 x x x ∑ F i ∑ T j > x \frac{\sum F_i}{\sum T_j}>x ∑Tj∑Fi>x 若环上存在重复经过的点,其 F i F_i Fi 只算一次,图中点、边数量不同。出现上述情况时,环由至少两个简单环构成。假设两个环上 F i , T i F_i,T_i Fi,Ti 的和分别为 x 1 , y 1 x_1,y_1 x1,y1 和 x 2 , y 2 x_2,y_2 x2,y2,环的某个交点为 p p p,则有 max ( x 1 y 1 , x 2 y 2 ) ≥ x 1 + x 2 y 1 + y 2 > x 1 + x 2 − F p y 1 + y 2 \max(\frac{x_1}{y_1},\frac{x_2}{y_2})\geq \frac{x_1+x_2}{y_1+y_2}>\frac{x_1+x_2-F_p}{y_1+y_2} max(y1x1,y2x2)≥y1+y2x1+x2>y1+y2x1+x2−Fp 可以观察到取简单环时答案更优,此时环上点、边数量相同。按照 0 / 1 0/1 0/1 分数规划的思想,将上式转换为 ∑ ( T i x − F i ) < 0 \sum (T_ix-F_i)<0 ∑(Tix−Fi)<0 S P F A SPFA SPFA 判定图中是否存在负环即可。
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int maxn = 1005, maxm = 5005, inf = 0x3f3f3f3f;
const double eps = 1e-4;
int N, M, F[maxn], cnt[maxn];
int tot, head[maxn], to[maxm], T[maxm], nxt[maxm];
double cost[maxm], ds[maxn];
bool in[maxn];
void inline add(int x, int y, int t)
{
to[++tot] = y, T[tot] = t, nxt[tot] = head[x], head[x] = tot;
}
bool SPFA()
{
memset(cnt, 0, sizeof(cnt));
memset(in, 0, sizeof(in));
fill(ds + 1, ds + N + 1, inf);
ds[1] = 0, in[1] = 1;
queue<int> q;
q.push(1);
while (q.size())
{
int x = q.front();
q.pop(), in[x] = 0;
for (int i = head[x]; i; i = nxt[i])
{
int y = to[i];
double z = cost[i];
if (ds[x] + z < ds[y])
{
ds[y] = ds[x] + z, cnt[y] = cnt[x] + 1;
if (cnt[y] >= N)
return 1;
if (!in[y])
q.push(y), in[y] = 1;
}
}
}
return 0;
}
bool judge(double x)
{
for (int i = 1; i <= M; ++i)
cost[i] = T[i] * x - F[to[i]];
return SPFA();
}
int main()
{
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; ++i)
scanf("%d", F + i);
for (int i = 1, x, y, t; i <= M; ++i)
scanf("%d%d%d", &x, &y, &t), add(x, y, t);
double lb = 0, ub = 1000 * N;
while (ub - lb > eps)
{
double mid = (lb + ub) / 2;
if (judge(mid))
lb = mid;
else
ub = mid;
}
printf("%.2f\n", ub);
return 0;
}