摘要:
http://poj.org/problem?id=1789#include #include #include #define MAXN 2010 const int INF=1g[k][j]) { dis[j]=g[k][j]; } } } return true; } int main() { while(scanf("%d",&n)&&n){ for(int i=1;i<=n;i++) { scanf("%s",s... 阅读全文
摘要:
http://poj.org/problem?id=1258 1 #include 2 #include 3 #include 4 #define MAXN 110 5 6 const int INF=1g[k][j])35 {36 dis[j]=g[k][j];37 }38 }39 }40 printf("%d\n",sum);41 return true;42 }43 int main()44 {45 while(scanf("%d",&n)!=EOF){46 ... 阅读全文