wyrhero

Bad Cowtractors Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9195   Accepted: 3939 Description Bessie has been hired to build a cheap internet network among

Constructing Roads Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 17170   Accepted: 7019 Description There are N villages, which are numbered from 1 to N, and

还是畅通工程 Problem Description 某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当N为0时