[HNOI2009]最小圈--最优比率环

Luogu 3199

题目分析：

• 简化题意：求一个环，环的边数为$k$，边权为$w[i]$，使得$\frac{\sum w[i]}{k}$最小

• 设最优值为$ans$,则有：
  $\frac{\sum w[i]}{k}>=ans$
  $\sum w[i]-k\ast ans>=0$

• 二分$ans$,将$d[i]$初值赋值为$0$，若找到一个环，则$\sum w[i]-k\ast ans<0$,说明更优的$ans$，令$r=mid$

Code:

#include <bits/stdc++.h>
using namespace std;
#define eps 1e-10
#define maxn 3010
#define maxm 10010
#define re register

int n,m,size=0,head[maxn];
double mid,d[maxn];
bool vis[maxn];

struct edge {
	int v,nxt;
	double w;
}e[maxm];

inline void init_() {
	freopen("a.txt","r",stdin);
}

inline int read_() {
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9') {
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9') {
		x=(x<<1)+(x<<3)+c-'0';
		c=getchar();
	}
	return x*f;
}

inline void add_(int u,int v,double w) {
	e[++size].v=v;
	e[size].w=w;
	e[size].nxt=head[u];
	head[u]=size;
}

inline void clean_() {
	memset(head,-1,sizeof(head));
} 

bool dfs_(int u) {
	vis[u]=1;
	for(int i=head[u];~i;i=e[i].nxt) {
		int v=e[i].v;
		double w=e[i].w;
		if(d[v]>d[u]+w-mid) {
			d[v]=d[u]+w-mid;
			if(vis[v]||dfs_(v)) return vis[u]=0,1;
		}
	}
	return vis[u]=0;
}

inline bool pd_() {
	memset(d,0,sizeof(d));
//	memset(vis,false,sizeof(vis));
	for(int i=1;i<=n;++i) {
		if(dfs_(i)) return true;
	}
	return false;
}

void readda_() {
	n=read_();m=read_();
	clean_();
	double l=0,r=0;
	int x,y;double z;
	for(re int i=1;i<=m;++i) {
		x=read_();y=read_();
		scanf("%lf",&z);
		add_(x,y,z);
		if(z<0) l+=z;
		else r+=z;
	}
	double ans;
	while(r-l>eps) {
		mid=(l+r)/2;
		if(pd_()) {
			ans=mid;
			r=mid;
		}
		else l=mid;
	}
	printf("%.8lf",ans);
}

int main() {
	init_();
	readda_();
	return 0;
}