文章标题 Coderforces 689B ： Mike and Shortcuts （BFS）

Mike and Shortcuts

Recently, Mike was very busy with studying for exams and contests. Now he is going to chill a bit by doing some sight seeing in the city.
City consists of n intersections numbered from 1 to n. Mike starts walking from his house located at the intersection number 1 and goes along some sequence of intersections. Walking from intersection number i to intersection j requires |i - j| units of energy. The total energy spent by Mike to visit a sequence of intersections p1 = 1, p2, …, pk is equal to units of energy.
Of course, walking would be boring if there were no shortcuts. A shortcut is a special path that allows Mike walking from one intersection to another requiring only 1 unit of energy. There are exactly n shortcuts in Mike’s city, the ith of them allows walking from intersection i to intersection ai (i ≤ ai ≤ ai + 1) (but not in the opposite direction), thus there is exactly one shortcut starting at each intersection. Formally, if Mike chooses a sequence p1 = 1, p2, …, pk then for each 1 ≤ i < k satisfying pi + 1 = api and api ≠ pi Mike will spend only 1 unit of energy instead of |pi - pi + 1| walking from the intersection pi to intersection pi + 1. For example, if Mike chooses a sequence p1 = 1, p2 = ap1, p3 = ap2, …, pk = apk - 1, he spends exactly k - 1 units of total energy walking around them.
Before going on his adventure, Mike asks you to find the minimum amount of energy required to reach each of the intersections from his home. Formally, for each 1 ≤ i ≤ n Mike is interested in finding minimum possible total energy of some sequence p1 = 1, p2, …, pk = i.
Input
The first line contains an integer n (1 ≤ n ≤ 200 000) — the number of Mike’s city intersection.
The second line contains n integers a1, a2, …, an (i ≤ ai ≤ n , , describing shortcuts of Mike’s city, allowing to walk from intersection i to intersection ai using only 1 unit of energy. Please note that the shortcuts don’t allow walking in opposite directions (from ai to i).
Output
In the only line print n integers m1, m2, …, mn, where mi denotes the least amount of total energy required to walk from intersection 1 to intersection i.
Example
Input
3
2 2 3
Output
0 1 2
Input
5
1 2 3 4 5
Output
0 1 2 3 4
Input
7
4 4 4 4 7 7 7
Output
0 1 2 1 2 3 3
Note
In the first sample case desired sequences are:
1: 1; m1 = 0;
2: 1, 2; m2 = 1;
3: 1, 3; m3 = |3 - 1| = 2.
In the second sample case the sequence for any intersection 1 < i is always 1, i and mi = |1 - i|.
In the third sample case — consider the following intersection sequences:
1: 1; m1 = 0;
2: 1, 2; m2 = |2 - 1| = 1;
3: 1, 4, 3; m3 = 1 + |4 - 3| = 2;
4: 1, 4; m4 = 1;
5: 1, 4, 5; m5 = 1 + |4 - 5| = 2;
6: 1, 4, 6; m6 = 1 + |4 - 6| = 3;
7: 1, 4, 5, 7; m7 = 1 + |4 - 5| + 1 = 3.

题意：有n个点，从1到n，每两个点之间的距离为两点之差的绝对值，每个点都有一条捷径去另一个点，通过这条捷径只需1个单位的距离，现要求的是点1 到其他点的距离的最小值。
分析：假定此时在点u,在点u到达其他点只需要1个单位距离的点分别为u-1，u+1，还有a[u]这三个点，所以每次只需要比较dis[u-1]与dis[u]+1的大小，另外两点类似。用bfs从点1开始广搜一下就能得到最短距离了。
代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<math.h>
#include<map>
#include<queue> 
#include<algorithm>
using namespace std;
const int inf = 0x3f3f3f3f;
int n;
int a[200005];
int dis[200005];
int vis[200005];
void spfa(){
    memset (vis,0,sizeof (vis));
    memset (dis,inf,sizeof (dis));
    dis[1]=0;
    queue <int> q;
    vis[1]=vis[0]=1;
//一开始表示已经在队列中了
    q.push(1);
    while (!q.empty()){
        int u = q.front();q.pop();vis[u]=0;
        if (dis[a[u]]>dis[u]+1){
//松弛一下，成功则更新并加入队列
            dis[a[u]]=dis[u]+1;
            if (!vis[a[u]]){
                q.push(a[u]);
                vis[a[u]]=1;
            }
        }
        if (dis[u-1]>dis[u]+1){
//同上
            dis[u-1]=dis[u]+1;
            if (!vis[u-1]){
                q.push(u-1);
                vis[u-1]=1;
            }
        }
        if (dis[u+1]>dis[u]+1) {
//同上
            dis[u+1]=dis[u]+1;
            if (!vis[u+1]){
                q.push(u+1);
                vis[u+1]=1;
            }
        }
    } 
} 
int main ()
{
    while (cin>>n){
        for (int i=1;i<=n;i++){
            cin>>a[i];
        }
        spfa();
        for (int i=1;i<=n;i++){
//输出
            if (i==1) cout<<dis[i];
            else cout<<" "<<dis[i];
        } 
        cout<<endl;
    }
    return 0;
}