蓝桥杯-2019第十届蓝桥杯B组C++完全二叉树的权值

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
using namespace std;
 
#define INF 0x3f3f3f3f
#define N 100005
 
int num[N]={0};
 
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
		scanf("%d",&num[i]);
	int ans=1,k=0,max=-INF;
	for(int i=1;i<=ceil(log(n+1)/log(2));i++)
	{
		int sum=0; 
		for(int j=0;j<pow(2,i-1);j++)
			sum+=num[k++];
		if(sum>max)
		{
			max=sum;
			ans=i;
		}
	}
	printf("%d\n",ans);
	return 0;
}