摘要：
Problem: 1258User: qq1203456195Memory: 208KTime: 16MSLanguage: CResult: Accepted#include <stdio.h>#include <stdlib.h>#include <string.h>#define N 105#define MAX 100005int visited[N],closet[N],Metr[N][N];int n;int prim(){ int i,ms,next,sum,j; memset(visited,0,sizeof(visited)); for ( 阅读全文
