const int maxn=110; int dist[maxn][maxn], map[maxn][maxn]; //最短距离，原图int pre[maxn][maxn]; // pre[i,j]记录最短路里，j前面一个点int path[maxn]; // 答案路径int n, m, num, minc; // num记录path里有多少个点，minc是最短环长度int

题目： 1004. Sightseeing Trip Time limit: 0.5 second Memory limit: 64 MB There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other a