Weight recursion of complete binary tree -- the last programming challenge

utilize k*2+1 and k*2
Every time I look for k My son , Record the number of layers when searching
Finally, we need to make a circular judgment
notes ： Judgment can no longer dfs In the middle of Because the final answer is likely to be the result of a certain period of time on a certain layer Not the end result

#include <iostream>
#include <algorithm>
using namespace std;
const int n = 100005;
typedef long long ll;
int t[n];
int ans = 0;
ll maxt = -1e35;
int lcnt;
ll level[n];
int N;
void dfs(int k, int l)
{
    if (k > N)
        return;
    //  How many layers of records 
    lcnt = max(l, lcnt);
    //  Every time you join 
    level[l] += t[k];
    dfs(k * 2, l + 1);
    dfs(k * 2 + 1, l + 1);
}
int main()
{
    cin >> N;
    for (int i = 1; i <= N; i++)
        scanf("%d", &t[i]);
    dfs(1, 1);
    for (int i = 1; i <= lcnt; i++)
    {
        if (maxt < level[i])
            maxt = level[i], ans = i;
    }

    printf("%d", ans);
    return 0;
}