Acwing周赛42 C(太菜咧)

题目
题意: 给定深度为n的完全二叉树，可以任意增加任意边的边权，求最少需要增加多少才能使得树根到叶子节点的距离均相等。(n<=10)
思路: dfs。能在上边加的就在上边加，因为这样涉及面广。假设左子树的路径和为l，右子树的路径和为r，dfs求出以i为树根的最大路径和。贡献为abs(l-r).
时间复杂度: O(2^n)
代码:

// Problem: 满二叉树等长路径
// Contest: AcWing
// URL: https://www.acwing.com/problem/content/4316/
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
int a[N];
bool vis[N];
ll ans = 0;
int dfs(int cur) //返回以i为树根的最大
{
	if(cur * 2 > n) return 0; //叶子节点
	int l = cur<<1;
	int r = cur<<1|1;
	int x = dfs(l) + a[l];
	int y = dfs(r) + a[r];
	ans += abs(x-y);
	return max(x,y);
}
void solve()
{
   read(n);
   n = (1<<(n+1))-1;
   for(int i=2;i<=n;++i)
   {
   	  read(a[i]);
   }
   dfs(1);
   write(ans);
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}