hdu1548 最短路/BFS

指定起点和终点，用dijskal求最短路

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<sstream>
#define LL long long
#define OJ_DEBUG 0
#define READ_FILE 0
using namespace std;
const int NN_MAX = 210;
const int MM_MAX = 100010;
const int INF = 0x1fffffff;
struct Edge{
  int a,b,c;
  Edge (int a1=0,int b1=0,int c1=0):a(a1),b(b1),c(c1){}
  bool operator < (const Edge& chs) const {return c<chs.c;}
}theEdge[NN_MAX*NN_MAX];
/**********************************************************/
int lenEdge;
int n,s,t;
int maps[NN_MAX][NN_MAX],d[NN_MAX],vis[NN_MAX];
/**********************************************************/
int min_2 (int x,int y) {return x<y?x:y;}
int max_2 (int x,int y) {return x>y?x:y;}
bool dijkstra();
/**********************************************************/
int main()
{
    if (READ_FILE) freopen ("in.txt","r",stdin);
    while(scanf("%d",&n) && n)
    {
        scanf("%d %d",&s,&t);
        int a[NN_MAX]={-1};
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        for(int i=0;i<=n;i++)
            for(int j=i;j<=n;j++)
                maps[i][j]=maps[j][i]=(i==j?0:INF);
        for(int i=1;i<=n;i++){
            if(i-a[i]>=1) maps[i][i-a[i]]=1;
            if(i+a[i]<=n) maps[i][i+a[i]]=1;
        }
        if(dijkstra())
            printf("%d\n",d[t]);
        else
            printf("-1\n");
    }
    return 0;
}
bool dijkstra()
{
    memset(vis,0,sizeof(vis));
    for(int i=0;i<=n;i++) d[i]=INF;
    d[s]=0;
    for(int i=1;i<=n;i++){
        int x=0;
        for(int j=1;j<=n;j++)
            if(!vis[j] && d[j]<d[x])
                x=j;
        vis[x]=1;
        for(int y=1;y<=n;y++)
            if(!vis[y] && maps[x][y]<INF)
                d[y]=min_2(d[y],d[x]+maps[x][y]);
    }
    return d[t]<INF;
}

BFS需要注意一些特殊情况

1 1 1

1

这样的数据，输出0

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<sstream>
#define LL long long
#define OJ_DEBUG 0
#define READ_FILE 1
using namespace std;
const int NN_MAX = 210;
const int MM_MAX = 100010;
const int INF = 0x1fffffff;
/**********************************************************/
int n,s,t;
int a[NN_MAX],d[NN_MAX],vis[NN_MAX];
/**********************************************************/
int min_2 (int x,int y) {return x<y?x:y;}
int max_2 (int x,int y) {return x>y?x:y;}
bool bfs();
/**********************************************************/
int main()
{
    if (READ_FILE) freopen ("in.txt","r",stdin);
    while(scanf("%d",&n) && n)
    {
        scanf("%d %d",&s,&t);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        if(bfs())
            printf("%d\n",d[t]);
        else
            printf("-1\n");
    }
    return 0;
}
bool bfs()
{
    memset(vis,0,sizeof(vis));
    d[s]=0;
    queue<int>qee;
    qee.push(s);
    while(!qee.empty())
    {
        int x=qee.front();qee.pop();
        if(x==t) return true;
        vis[x]=1;
        int y=x-a[x];
        if(y>=1 && !vis[y]) {
            d[y]=d[x]+1;
            vis[y]=1;//步数最小，需要标记，贡献了几个WA
            qee.push(y);
        }
        y=x+a[x];
        if(y<=n && !vis[y]) {
            d[y]=d[x]+1;
            vis[y]=1;
            qee.push(y);
        }
    }
    return false;
}