问题描述
题目代码
#include<iostream>
#include<math.h>
using namespace std;
int main(){
int m,n;
int deep = 1;
int max_deep = 1;
int sum = 0;
long long max_sum = 0;
cin >> n;
for(int i=1;i<=n;i++){
cin >> m;
sum += m;
if(i == pow(2,deep) - 1){
if(max_sum < sum){
max_sum = sum;
max_deep = deep;
}
deep++;
sum = 0;
}
}
cout << max_deep <<endl;
return 0;
}