UVa10000_Longest Paths(最短路SPFA)
来源:互联网 发布:三星note8画图软件 编辑:程序博客网 时间:2024/05/22 17:41
解题报告
求最长路。
用SPFA求最长路,初始化图为零,dis数组也为零
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#define inf 99999999#define N 110using namespace std;int mmap[N][N],dis[N],vis[N],n;void spfa(int s){ int i; memset(dis,0,sizeof(dis)); memset(vis,0,sizeof(vis)); queue<int>Q; vis[s]=1; Q.push(s); while(!Q.empty()) { int u=Q.front(); Q.pop(); vis[u]=0; for(i=1; i<=n; i++) { if(mmap[u][i]) if(dis[i]<dis[u]+1) { dis[i]=dis[u]+1; if(!vis[i]) { vis[i]=1; Q.push(i); } } } }}int main(){ int u,v,s,i,j,k=1; while(~scanf("%d",&n)) { if(!n)break; scanf("%d",&s); memset(dis,0,sizeof(dis)); memset(vis,0,sizeof(vis)); memset(mmap,0,sizeof(mmap)); while(~scanf("%d%d",&u,&v)) { if(!u&&!v)break; mmap[u][v]=1; } spfa(s); int maxx=0,u=1000; for(i=1; i<=n; i++) { if(maxx<dis[i]) maxx=dis[i]; } for(i=1;i<=n;i++) { if(maxx==dis[i]&&u>i) u=i; } printf("Case %d: The longest path from %d has length %d, finishing at %d.\n\n",k++,s,maxx,u); } return 0;}
Longest Paths
Longest Paths
It is a well known fact that some people do not have their social abilities completely enabled. One example is the lack of talent for calculating distances and intervals of time. This causes some people to always choose the longest way to go from one place to another, with the consequence that they are late to whatever appointments they have, including weddings and programming contests. This can be highly annoying for their friends.
César has this kind of problem. When he has to go from one point to another he realizes that he has to visit many people, and thus always chooses the longest path. One of César's friends, Felipe, has understood the nature of the problem. Felipe thinks that with the help of a computer he might be able to calculate the time that César is going to need to arrive to his destination. That way he could spend his time in something more enjoyable than waiting for César.
Your goal is to help Felipe developing a program that computes the length of the longest path that can be constructed in a given graph from a given starting point (César's residence). You can assume that the graph has no cycles (there is no path from any node to itself), so César will reach his destination in a finite time. In the same line of reasoning, nodes are not considered directly connected to themselves.
Input
The input consists of a number of cases. The first line on each case contains a positive number n ( ) that specifies the number of points that César might visit (i.e., the number of nodes in the graph).A value of n = 0 indicates the end of the input.
After this, a second number s is provided, indicating the starting point in César's journey ( ). Then, you are given a list of pairs of places p and q, one pair per line, with the places on each line separated by white-space. The pair ``" indicates that César can visit qafter p.
A pair of zeros (``0 0") indicates the end of the case.
As mentioned before, you can assume that the graphs provided will not be cyclic.
Output
For each test case you have to find the length of the longest path that begins at the starting place. You also have to print the number of the final place of such longest path. If there are several paths of maximum length, print the final place with smallest number.
Print a new line after each test case.
Sample Input
211 20 0531 23 53 12 44 50 0555 15 25 35 44 14 20 00
Sample Output
Case 1: The longest path from 1 has length 1, finishing at 2.Case 2: The longest path from 3 has length 4, finishing at 5.Case 3: The longest path from 5 has length 2, finishing at 1.
- UVa10000_Longest Paths(最短路SPFA)
- UVA-10000 Longest Paths (SPFA最短路算法)
- hdu 6181 Two Paths(最短路,spfa)
- SPFA最短路
- 最短路之SPFA
- poj2472最短路spfa
- 最短路SPFA--poj3013
- 最短路 SPFA模板
- 最短路 SPFA
- 最短路spfa
- 最短路SPFA
- 最短路--SPFA算法
- 最短路SPFA算法
- 最短路SPFA
- 最短路SPFA
- 【SPFA】最短路 _HDU2544
- 【最短路】poj2472 SPFA
- 【最短路】poj2387 SPFA
- iOS 内支付(IAP)开发步骤
- 浅析Python的GIL和线程安全
- Mybatis学习总结
- android jni中碰到的问题 和步骤 (C 和 java互调)
- 自旋锁
- UVa10000_Longest Paths(最短路SPFA)
- EasyUI ComboGrid集成分页按键示例
- 【大数据】搭建简单的Hadoop集群
- 世界之大副科长东坑开学了
- sDJ政府将周大福控制东坑只看到这款
- 直接拿来用!最火的Android开源项目(一)
- 选择哪家家电清洗加盟好? 桶装水怎么消毒
- GLSL/C++ 实现滤镜效果
- 游泳池水处理设备过滤要看一下方面