There are n cities in Berland. Each city has its index — an integer number from 1 to n. The capital has index r1. All the roads in Berland are two-way. The road system is such that there is exactly one path from the capital to each city, i.e. the road map looks like a tree. In Berland‘s chronicles the road map is kept in the following way: for each city i, different from the capital, there is kept number pi — index of the last city on the way from the capital to i.
Once the king of Berland Berl XXXIV decided to move the capital from city r1 to city r2. Naturally, after this the old representation of the road map in Berland‘s chronicles became incorrect. Please, help the king find out a new representation of the road map in the way described above.
The first line contains three space-separated integers n, r1, r2 (2?≤?n?≤?5·104,?1?≤?r1?≠?r2?≤?n) — amount of cities in Berland, index of the old capital and index of the new one, correspondingly.
The following line contains n?-?1 space-separated integers — the old representation of the road map. For each city, apart from r1, there is given integer pi — index of the last city on the way from the capital to city i. All the cities are described in order of increasing indexes.
Output n?-?1 numbers — new representation of the road map in the same format.
3 2 3 2 2
2 3
6 2 4 6 1 2 4 2
6 4 1 4 2
题意：很不好理解，n个城市编号1-n，现在要从首都r1迁徙到首都r2，迁徙前有一个表示国家的地图，地图的表示方法为，每个点对应的是他的前驱，首都无前驱跳过，问迁徙后的地图表示方法。图必然是一棵生成树（n-1条边）
思路：每个点对应前驱相连，这样就能构成图了，在从新的首都往后遍历，遍历过程中记录下答案。
代码：
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 100005;
int n, r1, r2, sb;
vector<int> g[N];
int du[N], i;
int vis[N];
int ans[N];
void dfs(int now) {
vis[now] = 1;
for (int i = 0; i < g[now].size(); i++) {
int v = g[now][i];
if (vis[v]) continue;
ans[v] = now;
dfs(v);
}
}
int main() {
memset(vis, 0, sizeof(vis));
memset(du, 0, sizeof(du));
memset(g, 0, sizeof(g));
scanf("%d%d%d", &n, &r1, &r2);
for (i = 1; i <= n; i++) {
if (i == r1) continue;
scanf("%d", &sb);
g[i].push_back(sb);
g[sb].push_back(i);
du[i]++; du[sb]++;
}
dfs(r2);
int bo = 0;
for (i = 1; i <= n; i++) {
if (i == r2) continue;
if (bo++) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
return 0;
}