POJ 3621 Sightseeing Cows

详细思路参考

http://blog.csdn.net/find_my_dream/archive/2009/11/14/4810489.aspx

http://hi.baidu.com/ofeitian/blog/item/ee15253e4f0f4dce7c1e7123.html

 

有一点想说的是，如果存在负环1-2-3-1，则负环中每个顶点的欢乐值只是计算一次的

代码：

#include<iostream> #include<cstdio> #include<memory.h> #include<queue> using namespace std; const int MAX=1005; struct node { int v,next,w; }g[MAX*10]; int vis[MAX],happy[MAX],adj[MAX],inqueue[MAX]; double dis[MAX]; int n,p,e; void add(int u,int v,int c) { g[e].v=v; g[e].w=c; g[e].next=adj[u]; adj[u]=e++; } int spfa(double mid) { int i,u,v; double wei; queue<int>que; memset(vis,0,sizeof(vis)); memset(inqueue,0,sizeof(inqueue)); for(i=1;i<=n;i++) { que.push(i); inqueue[i]=1; dis[i]=0; } while(!que.empty()) { u=que.front(); que.pop(); inqueue[u]=0; for(i=adj[u];i!=-1;i=g[i].next) { v=g[i].v; wei=mid*g[i].w-happy[v]; if(dis[v]>dis[u]+wei) { dis[v]=dis[u]+wei; //cout<<dis[v]<<endl; if(!inqueue[v]) { que.push(v); inqueue[v]=1; if(++vis[v]>n) return 0; } } } } return 1; } int main() { int i,j,w; e=0; memset(adj,-1,sizeof(adj)); scanf("%d%d",&n,&p); for(i=1;i<=n;i++) scanf("%d",&happy[i]); while(p--) { scanf("%d%d%d",&i,&j,&w); add(i,j,w); } double l=0,r=100,mid,ans; while(r-l>0.001) { mid=(l+r)/2; if(spfa(mid)) r=mid; else l=mid; } printf("%.2lf/n",l); return 0; }