hdu 1690 Bus System

http://acm.hdu.edu.cn/showproblem.php?pid=1690

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#define maxn 500
#define LL __int64
using namespace std;
const LL inf=999999999999;

LL L1,L2,L3,L4,C1,C2,C3,C4;
LL g[maxn][maxn];
LL a[maxn];
int n,m;
LL st,ed;

LL Abs(LL x)
{
    if(x<0) return -x;
    return x;
}

LL judge(LL x)
{
    if(x>0&&x<=L1) return C1;
    else if(x>L1&&x<=L2) return C2;
    else if(x>L2&&x<=L3) return C3;
    else if(x>L3&&x<=L4) return C4;
    else return inf;
}

void floyd()
{
    for(int k=0; k<n; k++)
    {
        for(int i=0; i<n; i++)
        {
            if(g[i][k]==inf) continue;
            for(int j=0; j<n; j++)
            {
                if(g[i][j]>g[i][k]+g[k][j])
                    g[i][j]=g[i][k]+g[k][j];
            }
        }
    }
}

int main()
{
    int t;
    scanf("%d",&t);
    for(int case1=1; case1<=t; case1++)
    {
        cin>>L1>>L2>>L3>>L4>>C1>>C2>>C3>>C4;
        cin>>n>>m;
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<n; j++)
            {
                if(i==j) g[i][j]=0;
                else g[i][j]=inf;
            }
        }
        for(int i=0; i<n; i++)
        {
            cin>>a[i];
        }
        for(int i=0; i<n; i++)
        {
            for(int j=i+1; j<n; j++)
            {
                g[i][j]=g[j][i]=judge(Abs(a[i]-a[j]));
            }
        }
        floyd();
        printf("Case %d:\n",case1);
        for(int i=0; i<m; i++)
        {
            cin>>st>>ed;
            if(g[st-1][ed-1]!=inf)
            printf("The minimum cost between station %I64d and station %I64d is %I64d.\n",st,ed,g[st-1][ed-1]);
            else
                printf("Station %I64d and station %I64d are not attainable.\n",st,ed);
        }
    }
    return 0;
}