\(n\)点\(m\)条边,有点权、边权,路径权值为最大点权\(\times\)最小边权,\(dis(i,j)\)为\(i\)到\(j\)的最小权路径,求\(\sum dis(i,j)\)。\(n\le 300\)
floyd 从小到大枚举中转点,用\(minw(i,j)\)维护\(i\)到\(j\)的能经过路径的最小边权