One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered (方便的编号)1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (单向)(one-way roads connects pairs of farms; road i requires Ti (1 ≤ Ti ≤ 100) units of time to traverse.(有向图)
Each cow must walk to the party and, when the party is over, return to her farm. Each cow is lazy and thus picks an optimal route (最优路线)with the shortest time. A cow's return route might be different from her original route to the party since roads are one-way.(哈哈哈哈有向图双向路)
N只母牛(起始地点不同)要去X这个地方,给出有向图,要求求出他们到x后并且返回(不一定原路,有向图)的路程最大的母牛(算的是来回),
其中他们走到x和从x返回走的路径均是最短的。
思路:
从x到每个点的最短路径还算好求。直接Dijkstra即可
但是从每个点到x呢?
难道要n次Dijkstra?或者floyd?
不,那样效率太低了!
一个方法是进行矩阵转置,然后再来一次Dijkstra即可。
为什么这样可以?对于有向图,本来是从n个点到x的,你转置一下相当于x到n个点了。
很巧妙吧?
#include<iostream> #include<cstring> #include<stdio.h> #include<cmath> using namespace std; #define inf 0x3f3f3f3f const int maxn=1005; int n,m,x; int mmp[maxn][maxn]; int dis[maxn]; int total[maxn]; bool vis[maxn]; void map_reverse() { for(int i=1; i<=n; i++) for(int j=1; j<i; j++) swap(mmp[i][j],mmp[j][i]); } void dij(int st) { memset(vis,0,sizeof(vis)); for(int i=1; i<=n; i++) dis[i]=mmp[st][i]; dis[st]=0; vis[st]=1; for(int i=0; i<n; i++) { int temp=inf; int k; for(int j=1; j<=n; j++) if(dis[j]<temp&&!vis[j]) temp=dis[k=j]; vis[k]=1; for(int j=1; j<=n; j++) if(!vis[j]&&(dis[j]>dis[k]+mmp[k][j])) dis[j]=dis[k]+mmp[k][j]; } } int main() { int u,v,w; memset(mmp,inf,sizeof(mmp)); scanf("%d%d%d",&n,&m,&x); while(m--) { scanf("%d%d%d",&u,&v,&w); mmp[u][v]=w; } dij(x); for(int i=1; i<=n; i++) total[i]=dis[i]; map_reverse(); dij(x); for(int i=1; i<=n; i++) total[i]+=dis[i]; int ans=0; for(int i=1; i<=n; i++) ans=max(ans,total[i]); printf("%d\n",ans); return 0; }