什么是网站原创文章,网站制作要花多少钱,互动网页设计,网站没有备案可以访问吗链接#xff1a; #include stdio.h
int main()
{puts(转载请注明出处[辗转山河弋流歌 by 空灰冰魂]谢谢);puts(网址#xff1a;blog.csdn.net/vmurder/article/details/46467217);
} 题解#xff1a; 呃。拓扑图上从后往前扫就好了Qwq 代码… 链接 #include stdio.h
int main()
{puts(转载请注明出处[辗转山河弋流歌 by 空灰冰魂]谢谢);puts(网址blog.csdn.net/vmurder/article/details/46467217);
} 题解 呃。拓扑图上从后往前扫就好了Qwq 代码 #include queue
#include cstdio
#include cstring
#include iostream
#include algorithm
#define N 101000
using namespace std;
struct Eli
{int v,l,n;bool f;
}e[N1];
int head[N],cnt,d[N],D[N];
inline void add(int u,int v,int l)
{e[cnt].vv;e[cnt].ll;e[cnt].nhead[u];head[u]cnt;
}
double f[N];
queueintq;
bool vis[N];
int n,m;
void bfs()
{int i,u,v;q.push(n);while(!q.empty()){vis[uq.front()]true,q.pop();for(ihead[u];i;ie[i].n)if(!vis[ve[i].v])q.push(v);}
}
int main()
{int i,u,v;int a,b,c;scanf(%d%d,n,m);for(i1;im;i){scanf(%d%d%d,a,b,c);add(b,a,c),d[a];}for(i1;in;i)D[i]d[i]?d[i]:1;bfs();q.push(n);while(!q.empty()){uq.front(),q.pop(),f[u]/D[u];for(ihead[u];i;ie[i].n){if(vis[u])f[ve[i].v]f[u]e[i].l;if(--d[v]0)q.push(v);}}printf(%.2lf\n,f[1]);return 0;
}
