HDU - 1142 - A Walk Through the Forest (最短路+dfs)

题意：

终点到B和A有多少条路径，且终点到B的距离小于A

#include <bits/stdc++.h>

using namespace std;
const int maxn = 1e3 + 10;
const int inf = 0x3f3f3f3f;
int G[maxn][maxn];
int dis[maxn];
bool vis[maxn];
int p[maxn];
void Dijkstra(int s,int n)
{
    memset(vis,0,sizeof vis);
    int k,minn;
    memset(dis,inf,sizeof dis);
    dis[s] = 0;
    for(int i = 1; i<=n; i++)
    {
        k = -1;
        minn = inf;
        for(int j = 1; j <= n; j++)
        {
            //cout<<dis[j]<<'x';
            if(!vis[j] &&minn > dis[j])
            {
                minn = dis[j];
                k = j;
            }
        }
        //cout<<k<<"  ***"<<minn<<endl;
        //cout<<minn<<' '<<k<<' '<<dis[k]<<"(((("<<endl;
        //dis[k] = minn;
        vis[k] = 1;
        for(int j = 1; j <= n; j++)
        {
            if(!vis[j] &&dis[j] > G[k][j] + dis[k])
            {
                dis[j] = G[k][j] + dis[k];
            }
        }
    }
}
int dfs(int s,int n)
{
    if(p[s])
        return p[s];
    if(s==2)
        return 1;
    p[s] = 0;
    for(int i = 1; i <= n; i++)
    {
        if(G[s][i] < inf && dis[s] > dis[i])
        {
           p[s]+=dfs(i,n);
        }
    }
    return p[s];
}
int i,j,n,m,u,v,w;
int main()
{
    while(cin>>n &&n )
    {
        cin>>m;
        memset(p,0,sizeof  p);
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j<= n; j++)
            {
                G[i][j] =  (i == j? 0:inf);
            }
        }
        for(int i = 0; i< m; i++)
        {
            cin>>u>>v>>w;
            G[u][v] = G[v][u] = w;
        }
        Dijkstra(2,n);
        cout<<dfs(1,n)<<endl;
    }
    return 0;
}