tnn-jp https://blog.hatena.ne.jp/tnn-jp/ tnn-jp.hatenadiary https://tnn-jp.hatenadiary.org/ AIZU Online Judge C/C++ Problem 0144 : Packet Transportation 有向グラフの最短経路を求める問題。 ワーシャル-フロイド法で解いた。 #include <iostream> #include <vector> using namespace std; #define MAX 9999 int n; vector< vector<int> > rtr; void Floyd(){ int i, j, k, l; for( i=1; i<=n; i++ ){ for( j=1; j<=n; j++ ){ for( k=1; k<=n; k++ ){ if( rtr[j][k] > rtr… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftnn-jp.hatenadiary.org%2Fentry%2F20091107%2F1257579814" title="Volume 1 / 0144-&gt;0147 - tnn-jp.hatenadiary" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2009-11-07 16:43:34 rich https://tnn-jp.hatenadiary.org/entry/20091107/1257579814 1.0 100%