Codeforces Round #361 (Div. 2) B. Mike and Shortcuts

B. Mike and Shortcuts

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 sequencep1 = 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.

Examples

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 

对搜索算法的时间复杂度认识不清晰，看到200000的规模就没敢用搜索算法了，其实由于此题的特殊性完全可用搜索解决

一般说来，对于一个V个顶点，E条边的图来说，搜索算法的时间复杂度为O（V+E）。

对于此题来说，V = n，E最多为2n，所以最后时间复杂度为O（3n），显然是可以胜任的

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;

typedef long long LL;
const int maxn = 2e5 + 10;
int n, a[maxn];
int ans[maxn];
bool visit[maxn];

struct Node {
	int x, w;
	Node(int _x, int _w) : x(_x), w(_w) {}
};

void BFS() {
	memset(ans, 0, sizeof(ans));
	memset(visit, false, sizeof(visit));

	queue<Node> q;
	q.push(Node(1, 0));
	
	while (!q.empty()) {
		Node head = q.front();
		q.pop();
		if (visit[head.x]) continue;

		ans[head.x] = head.w;
		visit[head.x] = true;

		if (!visit[a[head.x]]) {
			q.push(Node(a[head.x], head.w + 1));
		}
		if (!visit[head.x + 1] && head.x + 1 <= n) {
			q.push(Node(head.x + 1, head.w + 1));
		}
		if (!visit[head.x - 1] && head.x - 1 > 1) {
			q.push(Node(head.x - 1, head.w + 1));
		}
	}
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
#endif
	while (scanf("%d", &n) != EOF) {
		for (int i = 1; i <= n; ++i) {
			scanf("%d", &a[i]);
		}
		BFS();
		for (int i = 1; i <= n; ++i) {
			printf("%d%c", ans[i], i != n ? ' ' : '\n');
		}
	}
	return 0;
}