aigoruan

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1599很有意思的floyd;#include<stdio.h>#include<string.h>const int N = 105;const int inf = 0xffffff;int as[N][N],bs[N][N],ans;void floyd(int n){ int k,i,j; for(k = 1; k <= n; ++ k){ for(i = 1; i <= k; ++ i) for(j = 1; j < i; ++ j) ... 阅读全文