摘要： 求负环自然要用 belllman#include #include int F,n,m,w,p,dist[501];structnode{ int s,e,t;}grid[5500];int bellman(){ int i,k; memset (dist,0,sizeof (dist)); for (k=1;k dist[ grid[i].e ]+grid[i].t) dist[ grid[i].s ]=dist[ grid[i].e ]+grid[i].t; for (i=1;i dist[ grid[i].e ]+grid[i].t) ... 阅读全文