（这不是Floyd吗，不是DP啊
干嘛要中间的那一段呢，memset a，读入，跑Floyd，结束了就。
```cpp
memset(a,127/3,sizeof(a));
cin >> n;
for(int i = 1;i < n;i++)
for(int j = i + 1;j <= n;j++)
cin >> a[i][j];
for(int k = 1;k <= n;k++)
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
```
by SrsgPrince_ @ 2023-05-02 18:50:31
这题看了，dp更简单
by SrsgPrince_ @ 2023-05-02 18:52:07