hdu 1690 floyd

来源：互联网发布：淘宝人脸认证为何失败编辑：程序博客网时间：2024/06/14 23:27

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1690
出现了两个傻逼错误··· 找了十年。
将数组大小M开成了4。。hdu 好像不能用lld。得用I64d。
还有这题INF 必须开大点···· 0x3f3f3f3f这是不行的开成0x7f7f7f7f可过
教训： 再简单的题也要小心，防止傻逼错误。。努力1Y。

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define M 109#define INF 1e18typedef long long ll;ll dp[M][M];ll d[M]; //一开始写成d[4] WA 找了半天···  简直傻逼ll l[4];ll c[4];ll n,m;void floyd(){    for(int k = 0;k < n;k++)        for(int i = 0;i < n;i++)        for(int j = 0;j < n;j++)        dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]);}int main(){    int t;    scanf("%d",&t);    int kase = 1;    while(t--)    {        for(int i = 0;i < 4;i++)            scanf("%I64d",&l[i]);        for(int i = 0;i < 4;i++)            scanf("%I64d",&c[i]);        scanf("%I64d %I64d",&n,&m);        for(int i = 0;i < n;i++)            scanf("%I64d",&d[i]);        for(int i = 0;i < n;i++)        for(int j = 0;j < n;j++)        {            if(i==j)            {                dp[i][j] = dp[j][i] = 0;                continue;            }            ll temp = abs(d[i]-d[j]);            ll *p = lower_bound(l,l+4,temp);            int pos = p-l;            if(pos <= 3)            dp[i][j] = dp[j][i] = c[pos];            else dp[i][j] = dp[j][i] = INF;            //因为才4个 直接遍历写也行 甚至直接四种情况写出来。但是感觉二分看起来爽一点。。        }        floyd();        printf("Case %d:\n",kase++);        for(int i = 0;i < m;i++)        {            int a,b;            scanf("%d %d",&a,&b);            if(dp[a-1][b-1] != INF)            printf("The minimum cost between station %d and station %d is %I64d.\n",a,b,dp[a-1][b-1]);            else            printf("Station %d and station %d are not attainable.\n",a,b);        }    }    return 0;}

0 0