Codeforces Round #361 (Div. 2) B
题意:有N个十字路口,我们是从十字路口1号出发,问到1~N这几号十字路口的最短举例,然后,对于每个十字路口,都有一个近路可以走,路径长度都是1,并且是单向边。最后输出从1出发到1~N这些点的最短举例。
思路:我们可以直接建边,但是别忘了考虑,我们可以从i点回到i-1这个点的可能性,因为有可能回溯回来再走是更优的解。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 2e5 + 7;
int N, a[maxN], dp[maxN], head[maxN], cnt;
struct Eddge
{
int nex, to;
Eddge(int a=-1, int b=0):nex(a), to(b) {}
}edge[maxN<<2];
inline void addEddge(int u, int v)
{
edge[cnt] = Eddge(head[u], v);
head[u] = cnt++;
}
void tp()
{
queue<int> Q;
Q.push(1); dp[1] = 0;
while(!Q.empty())
{
int u = Q.front(); Q.pop();
for(int i=head[u], v; ~i; i=edge[i].nex)
{
v = edge[i].to;
if(dp[v] > dp[u] + 1)
{
dp[v] = dp[u] + 1;
Q.push(v);
}
}
}
}
int main()
{
scanf("%d", &N);
for(int i=1; i<=N; i++) head[i] = -1;
for(int i=1; i<=N; i++)
{
scanf("%d", &a[i]);
addEddge(i, a[i]);
if(i < N) addEddge(i, i + 1);
if(i > 1) addEddge(i, i-1);
}
memset(dp, INF, sizeof(dp));
tp();
for(int i=1; i<=N; i++) printf("%d ", dp[i]);
puts("");
return 0;
}