Cow Marathon
Time Limit: 2000MS | Memory Limit: 30000K | |
Total Submissions: 5063 | Accepted: 2463 | |
Case Time Limit: 1000MS |
Description
After hearing about the epidemic of obesity in the USA, Farmer John wants his cows to get more exercise, so he has committed to create a bovine marathon for his cows to run. The marathon route will include a pair of farms and a path comprised of a sequence of roads between them. Since FJ wants the cows to get as much exercise as possible he wants to find the two farms on his map that are the farthest apart from each other (distance being measured in terms of total length of road on the path between the two farms). Help him determine the distances between this farthest pair of farms.
Input
* Lines 1.....: Same input format as "Navigation Nightmare".
Output
* Line 1: An integer giving the distance between the farthest pair of farms.
Sample Input
7 6 1 6 13 E 6 3 9 E 3 5 7 S 4 1 3 N 2 4 20 W 4 7 2 S
Sample Output
52
Hint
The longest marathon runs from farm 2 via roads 4, 1, 6 and 3 to farm 5 and is of length 20+3+13+9+7=52.
Source
题目大意:求数的最大直径,这里后面的字母没啥用。
解题思路:模板,裸题目。
代码如下:
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
struct node
{
int from,to,val,last;
}bian[100020];
int head[50010];
int vis[50010];
int dis[50010];
int n,m;
int num;
int x,y,z;
char dir;
int start;
void add(int s,int e,int power)
{
bian[num].from=s;
bian[num].to=e;
bian[num].val=power;
bian[num].last=head[s];
head[s]=num;
num++;
}
void bfs(int x)
{
int r=x;
queue<int>q;
q.push(r);
vis[r]=1;
dis[r]=0;
while(!q.empty())
{
int tmp1=q.front();
q.pop();
for(int i=head[tmp1];i!=-1;i=bian[i].last)//找它当前能连接的最大边
{
int tmp2=bian[i].to;
if(vis[tmp2]==0&&dis[tmp2]<dis[tmp1]+bian[i].val)
{
dis[tmp2]=dis[tmp1]+bian[i].val;
vis[tmp2]=1;
q.push(tmp2);
}
}
}
int max=-1;
for(int i=1;i<=n;i++)
{
if(dis[i]>max)
{
max=dis[i];
start=i;
}
}
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
num=0;
memset(head,-1,sizeof(head));
for(int i=0;i<m;i++)
{
scanf("%d %d %d %c",&x,&y,&z,&dir);
add(x,y,z);
add(y,x,z);
}
memset(vis,0,sizeof(vis));
memset(dis,0,sizeof(dis));
bfs(1);
memset(vis,0,sizeof(vis));
memset(dis,0,sizeof(dis));
bfs(start);
printf("%d\n",dis[start]);
}
return 0;
}