HDU 5636 Shortest Path(floyd)

题意: $N,M\le 10^5,N个点M条边的形成一条链的无向图$$即只有(i,i+1,1)这样的边,i\in[1,N)$$现在添加3条长度为1的边,Q次询问dis(a,b)$     Read more
TaoSama's avatar
TaoSama Apr 07, 2016

HDU 4650 Minimum Average Weight Path(floyd)

题意: $N\le 100,M\le 10^4,N个点,M条边的图,无重边,可能有自环$$所有节点对(u, v)的min\{\frac{dis(u, v)}{len(u, v)}\},不连通输出NO$     Read more
TaoSama's avatar
TaoSama Mar 28, 2016