BFS+prim在prim之前很暴力地求出各点之间距离。要注意只有在A和S处可以分开，题目有描述。读取x和y后要用gets读取换行符。#include<iostream>#include<stdio.h>#include<string.h>#include<queue>#define MAXD 51#define INF 0x3f3f3f3fusing namespace std;int N,graph[MAXD][MAXD],dis[MAXD][MAXD],a[MAXD*2][2],x,y,cost[MAXD*2][MAXD*2],e;char Read More
