Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <iostream>#include <cstdio>#define MAX_N 100#define INF 32767using namespace std;int d[MAX_N][MAX_N];int main() {int N, M;scanf("%d %d", &N, &M);for (int i = 0; i < N; i++) {for (int j = 0; j < N; j++) {d[i][j] = INF;}}for (int i = 0; i < M; i++) {int u, v, length;scanf("%d %d %d", &u, &v, &length);d[u-1][v-1] = min(d[u-1][v-1], length);// 无向图,所以权值对称d[v-1][u-1] = d[u-1][v-1];}for (int i = 0; i < N; i++) {d[i][i] = 0;}