牛客寒假训练营第三场D

最新推荐文章于 2021-02-09 20:10:25 发布

kosf_

最新推荐文章于 2021-02-09 20:10:25 发布

阅读量135

点赞数

本文链接：https://blog.csdn.net/kosf_/article/details/104227083

版权

题目

好长啊不截图了~！
题目链接：https://ac.nowcoder.com/acm/contest/3004/D
垃圾题！

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[400010],pos[400010];
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int n;
	cin>>n;
	memset(a,-1,sizeof a);
	int cnt=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]!=-1) pos[a[i]]=i,cnt++;
	}
	printf("The size of the tree is %d\n",cnt);
	printf("Node %d is the root node of the tree\n",a[1]);
	for(int i=1;i<=cnt;i++){
		printf("The father of node %d is %d, the left child is %d, and the right child is %d\n",i,a[pos[i]/2],a[pos[i]*2],a[pos[i]*2+1]);
	}
    return 0;
}