-----最短路 最大值 hdu 5137-How Many Maos Does the Guanxi Worth

“Guanxi” is a very important word in Chinese. It kind of means “relationship” or “contact”. Guanxi can be based on friendship, but also can be built on money. So Chinese often say “I don’t have one mao (0.1 RMB) guanxi with you.” or “The guanxi between them is naked money guanxi.” It is said that the Chinese society is a guanxi society, so you can see guanxi plays a very important role in many things.

Here is an example. In many cities in China, the government prohibit the middle school entrance examinations in order to relief studying burden of primary school students. Because there is no clear and strict standard of entrance, someone may make their children enter good middle schools through guanxis. Boss Liu wants to send his kid to a middle school by guanxi this year. So he find out his guanxi net. Boss Liu’s guanxi net consists of N people including Boss Liu and the schoolmaster. In this net, two persons who has a guanxi between them can help each other. Because Boss Liu is a big money(In Chinese English, A “big money” means one who has a lot of money) and has little friends, his guanxi net is a naked money guanxi net – it means that if there is a guanxi between A and B and A helps B, A must get paid. Through his guanxi net, Boss Liu may ask A to help him, then A may ask B for help, and then B may ask C for help …… If the request finally reaches the schoolmaster, Boss Liu’s kid will be accepted by the middle school. Of course, all helpers including the schoolmaster are paid by Boss Liu.

You hate Boss Liu and you want to undermine Boss Liu’s plan. All you can do is to persuade ONE person in Boss Liu’s guanxi net to reject any request. This person can be any one, but can’t be Boss Liu or the schoolmaster. If you can’t make Boss Liu fail, you want Boss Liu to spend as much money as possible. You should figure out that after you have done your best, how much at least must Boss Liu spend to get what he wants. Please note that if you do nothing, Boss Liu will definitely succeed.
Input
There are several test cases.

For each test case:

The first line contains two integers N and M. N means that there are N people in Boss Liu’s guanxi net. They are numbered from 1 to N. Boss Liu is No. 1 and the schoolmaster is No. N. M means that there are M guanxis in Boss Liu’s guanxi net. (3 <=N <= 30, 3 <= M <= 1000)

Then M lines follow. Each line contains three integers A, B and C, meaning that there is a guanxi between A and B, and if A asks B or B asks A for help, the helper will be paid C RMB by Boss Liu.

The input ends with N = 0 and M = 0.

It’s guaranteed that Boss Liu’s request can reach the schoolmaster if you do not try to undermine his plan.
Output
For each test case, output the minimum money Boss Liu has to spend after you have done your best. If Boss Liu will fail to send his kid to the middle school, print “Inf” instead.
Sample Input
4 5
1 2 3
1 3 7
1 4 50
2 3 4
3 4 2
3 2
1 2 30
2 3 10
0 0
Sample Output
50
Inf
题目大意：
刘老板通过他的关系圈来贿赂朋友，然后再通过朋友们来贿赂校长，贿赂成功后，儿子才能上一个好的中学， 你要阻止刘老板这种不太好的行为，因此你可以说服关系圈中的某一个人，让他拒绝刘老板的帮忙，当然你肯定不能说服刘老板和校长中的其中一个，1代表刘老板，n代表校长，如果存在当你说服一个人后，使得刘老板无法得到校长的的帮忙的话，输出”inf”,否则你应该使得刘老板尽量花更多的钱，但是刘老板也不傻，他总是能找到关系圈中的最短路，使得自己花的钱最少；
解题思路：
做法就是暴力枚举删点，从i=2枚举到i=n-1,依次最短路，求最大值即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <math.h>
#define INF 1e18

using namespace std;

long long map[110][110],dis[110],visited[110];

long long Dijkstra(int n,int x)
{
    long long i,p,j,min;
    for (i=1;i<=n;i++)
    {
        dis[i]=map[1][i];
        visited[i]=0;
    }
    visited[x]=1;
    for (i=1;i<=n;i++)
    {
        min=INF;
        for (j=1;j<=n;j++)
        {
            if(!visited[j] && dis[j]<=min)
            {
                p=j;
                min=dis[j];
            }
        }
        visited[p]=1;
        for (j=1;j<=n;j++)
        {
            if(!visited[j] && dis[p]+map[p][j]<dis[j])
            {
                    dis[j]=dis[p]+map[p][j];
            }
        }
    }
    return dis[n];
}
long long a1[40];
int main()
{
    long long n,m,i,j,a,b,t;
    while(scanf("%lld%lld",&n,&m)!=EOF&&n+m)
    {
        for (i=1;i<=n;i++)
        {
            for (j=1;j<=n;j++)
            {
                map[i][j]=INF;
            }
        }
        for(i=1;i<=m;i++)
        {
            scanf("%lld%lld%lld",&a,&b,&t);
            map[a][b]=map[b][a]=t;
        }
        long long maxn=Dijkstra(n,1);
        int flag=0;
        for(i=2;i<n;i++)
        {
            memset(a1,0,sizeof(a1));
            for(j=1;j<=n;j++)
            {
                if(map[i][j]!=INF)
                {
                    a1[j]=map[i][j];
                    map[i][j]=INF;
                    map[j][i]=INF;
                }
            }
            long long k=Dijkstra(n,1);
            if(k>=INF)
            {
                flag=1;
                break;
            }
            else
            {
                maxn=max(maxn,k);
                for(j=1;j<=n;j++)
                {
                    if(a1[j]!=0)
                    {
                        map[i][j]=a1[j];
                        map[j][i]=a1[j];
                    }
                }
            }
        }
        if(flag==0)
        printf("%lld\n",maxn);
        else  printf("Inf\n");
    }
    return 0;
}