题目大意就是找到一个环使得顶点权值之和与边权之和的比率最大
首先,需要注意的是题目要求可以从任意一点开始,网上很多解题报告默认的从1点开始,虽然过了此题,但是显然是不太对的
由于题目是求的max,那么在边权变形后,用 SPFA求最短路,看是否出现负环, 然后根据这个进行二分查找。
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 100010
#define MOD 1000000007
struct Edge
{
int to,next;
double weight;
}edge[50050];
int n,m,tot;
int head[1010],vis[1010],c[1010];
double val[1010],dis[1010];
void add_edge(int u,int v,double w)
{
edge[tot].to = v;
edge[tot].weight = w;
edge[tot].next = head[u];
head[u] = tot++;
}
int spfa(double mid)
{
queue<int> q;
for(int i = 1; i <= n; i++)
{
vis[i] = 1;
c[i] = 1;
dis[i] = 0;
q.push(i);
}
while(!q.empty())
{
int u = q.front();
q.pop();
vis[u] = 0;
for(int i = head[u]; i != -1; i = edge[i].next)
{
int v = edge[i].to;
double weight = mid * edge[i].weight - val[u];
if(dis[v] > dis[u] + weight)
{
dis[v] = dis[u] + weight;
if(!vis[v])
{
q.push(v);
vis[v] = 1;
c[v]++;
if(c[v] > n)
return 1;
}
}
}
}
return 0;
}
int main()
{
int t,C = 1;
//scanf("%d",&t);
while(scanf("%d%d",&n,&m) != EOF)
{
tot = 0;
memset(head,-1,sizeof(head));
for(int i = 1; i <= n; i++)
scanf("%lf",&val[i]);
while(m--)
{
int u,v;
double w;
scanf("%d%d%lf",&u,&v,&w);
add_edge(u,v,w);
}
double l = 0,r = 1000;
while(r - l > 0.001)
{
double mid = 1.0*(r + l) / 2;
if(spfa(mid))
l = mid;
else
r = mid;
}
printf("%.2f\n",l);
}
return 0;
}