2013
11-11

# Out of Hay

The cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farms (numbered 1..N); Bessie starts at Farm 1. She'll traverse some or all of the M (1 <= M <= 10,000) two-way roads whose length does not exceed 1,000,000,000 that connect the farms. Some farms may be multiply connected with different length roads. All farms are connected one way or another to Farm 1.

Bessie is trying to decide how large a waterskin she will need. She knows that she needs one ounce of water for each unit of length of a road. Since she can get more water at each farm, she’s only concerned about the length of the longest road. Of course, she plans her route between farms such that she minimizes the amount of water she must carry.

Help Bessie know the largest amount of water she will ever have to carry: what is the length of longest road she’ll have to travel between any two farms, presuming she chooses routes that minimize that number? This means, of course, that she might backtrack over a road in order to minimize the length of the longest road she’ll have to traverse.

* Line 1: Two space-separated integers, N and M.

* Lines 2..1+M: Line i+1 contains three space-separated integers, A_i, B_i, and L_i, describing a road from A_i to B_i of length L_i.

* Line 1: A single integer that is the length of the longest road required to be traversed.

3 3
1 2 23
2 3 1000
1 3 43

43

OUTPUT DETAILS:

In order to reach farm 2, Bessie travels along a road of length 23. To reach farm 3, Bessie travels along a road of length 43. With capacity 43, she can travel along these roads provided that she refills her tank to maximum capacity before she starts down a road.

/* @author: */
import java.util.Scanner;
public class Main{
public static void main(String args[])
{
int p[][]=new int[2001][2001];
int n,m,i,j,k;
int dis[]=new int[2001];
int u,v,l;
int ne[]=new int[2001];
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
m=sc.nextInt();
int max=0;
for(i=0;i< n;i++)
for(j=0;j< n;j++)
p[i][j]=1000000001;
for(i=0;i< m;i++)
{
u=sc.nextInt();
v=sc.nextInt();
l=sc.nextInt();
u--;
v--;
if(p[u][v]>l)p[u][v]=p[v][u]=l;
}
for(i=0;i< n;i++)
{
dis[i]=p[0][i];
ne[i]=0;
}
ne[0]=-1;
for(i=0;i< n-1;i++)
{
int min=1000000001,tag=-1;
for(j=0;j< n;j++)
if(ne[j]!=-1&&dis[j]< min)
{
min=dis[j];
tag=j;
}
ne[tag]=-1;
if(dis[tag]>max)max=dis[tag];
for(j=0;j< n;j++)
if(ne[j]!=-1&&p[tag][j]< dis[j])
{
dis[j]=p[tag][j];
ne[j]=tag;
}
}
System.out.printf("%d",max);
}
}

1. 其实国内大部分公司对算法都不够重视。特别是中小型公司老板根本都不懂技术，也不懂什么是算法，从而也不要求程序员懂什么算法，做程序从来不考虑性能问题，只要页面能显示出来就是好程序，这是国内的现状，很无奈。

2. simple, however efficient. A lot of instances it is difficult to get that a??perfect balancea?? among usability and appearance. I must say that youa??ve done a exceptional task with this. Also, the blog masses quite fast for me on Web explore.