duanghaha的博客

EZDIJKST - Easy Dijkstra Problemno tags Determine the shortest path between the specified vertices in the graph given in the input data.Hint: You can use Dijkstra's algorithm.Hint 2: if you're a lazy ...

  find the safest road   Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15957    Accepted Submission(s): 5538     Problem Description ...

题面 题意： 对于floyedfloyedfloyed算法，Di,jD_{i,j}Di,j​表示最外层循环最小的能够求出来disi,jdis_{i,j}disi,j​的循环次数，计算∑i=1n∑j=1nDi,j\sum_{i=1}^{n}{\sum_{j=1}^{n}{D_{i,j}}}∑i=1n​∑j=1n​Di,j​ 思路 其实Di,jD_{i,j}Di,j​即为iii到jjj的最短路路径上最...