poj2949-Word Rings

题意：给定一个图，求一个环，使该环的平均权值最大。

算法：二分答案，用SPFA判断是否有负环

代码：

#include <iostream>       
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
using namespace std;


int k, n, m;


const int maxn = 2010;
const int maxm = 1010*1010*2;
const int INF = 0x3f3f3f3f;


double d[maxn];


struct Edge
{
	int u, v;
	double w;
	int next;
}edge[maxm];


int cnt;
int first[maxn];


void add_edge(int u, int v, double w)
{
	edge[cnt].v = v, edge[cnt].w = w;
	edge[cnt].next = first[u], first[u] = cnt++;
}


bool inq[maxn];


double L, R;


int spfa(double mid)
{
	//用queue会超时
	stack<int> Q;
	for(int i = 1; i <= k; i++)
	{
		d[i] = 0;
		Q.push(i);
		inq[i] = 1;
	}
	
	int CNT[maxn] = {0};
	while(!Q.empty())
	{
		int x = Q.top(); Q.pop();
		inq[x] = 0;
		for(int e = first[x]; e != -1; e = edge[e].next)
		{
			int v = edge[e].v;
			double w = edge[e].w;
			if(d[v] < d[x]+w)
			{
				d[v] = d[x]+w;
				if(!inq[v])
				{
					inq[v] = 1;
					if(++CNT[v] > k) return 1;
					Q.push(v);
				}
			}
		}
	}
	return 0;
}


void init()
{
	cnt = 0;
	memset(first, -1, sizeof(first));
}


int ord(char x, char y)
{
    return (x-'a')*26+y-'a'+1;
}


int have_cycle(double mid)
{
	//常数优化：在跑spfa之前更改权值，可以稍快一点。
	for(int i = 0; i < m; i++) 
		edge[i].w -= mid;
	
	int flag = 0;
	if(spfa(mid)) flag = 1;
	
	for(int i = 0; i < m; i++) 
		edge[i].w += mid;
	return flag;
}


const double eps = 1e-2;


char word[1010];


int vis[3010];


void build_graph()
{
	k = 0;
	for(int i = 0; i < m; i++)
	{
		scanf("%s", word);
		int len = strlen(word);
		int a = ord(word[0], word[1]);
    	int b = ord(word[len-2], word[len-1]);
    	if(!vis[a]) vis[a] = ++k;
    	if(!vis[b]) vis[b] = ++k;
    	R = max(R, len*1.0);
    	add_edge(vis[a], vis[b], len*1.0);
	}
}


int main()
{
	while(scanf("%d", &m))
	{
		if(!m) break;
		init();
		
		memset(vis, 0, sizeof(vis));    
		L = 0, R = 0;
		
		build_graph();
		
		double ans = -1;
		
		while(R-L >= eps)
		{
			double mid = (L+R)/2.0;
			if(have_cycle(mid))
			{
				ans = mid;
				L = mid;
			}
			else R = mid;
		}
		if(ans == -1) printf("No solution.\n");
		else printf("%.2f\n", ans);
	}
	return 0;
}