L2-043 龙龙送外卖

作者：weixin_40725706 | 2024-02-24 21:58:50

L2-043 龙龙送外卖


#include <iostream>
using namespace std;
int fa[100005] = { 0 };
int vis[100005] = { 0 };
int count = 0, s = 0;
int fun(int a) {
	if (fa[a] == -1 || vis[a]) return vis[a];
	::count++;
	return vis[a] = 1 + fun(fa[a]);
}
int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> fa[i];
	int a;
	while (m--) {
		cin >> a;
		s = max(s, fun(a));
		cout << 2 * ::count - s << endl;
	}
	return 0;
}

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/weixin_40725706/article/detail/136178