2019省赛A组第6题 完全二叉树的权值
思路: 每行都是从2 ^ (i - 1)~2^i-1,(i=1,2,3……)
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int n;
cin >> n;
int maxx = -100010,maxid=0;
int a, sum = 0,j=1,i=1;
while (1) {
if (i > n) {
break;
}
sum = 0;
for (; i <= n && i <= pow(2, j) - 1; i++) {
cin >> a;
sum += a;
}
if (maxx < sum)
{
maxx = sum;
maxid = j;
}
j++;
}
cout << maxid;
return 0;
}