ACwing 周赛42 满二叉树等长路径

4313. 满二叉树等长路径
思路：
可以发现深度小的边增加长度可以贡献更多
贪心的想应该先消除深度大的子树之间的路径差
递归分治即可
code：

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) x.begin(), x.end()
#define mem(x, d) memset(x, d, sizeof(x))
#define eps 1e-6
using namespace std;
const int maxn = 2e6 + 9;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, m;
ll tr[maxn];
ll ans = 0;

int dfs(int x){
	if(x * 2 > n - 1) return 0;
	ll l = dfs(x << 1) + tr[x << 1];
	ll r = dfs(x << 1 | 1) + tr[x << 1 | 1];
	ans += abs(r - l);
	return max(l, r);  
}
void work()
{
	cin >> n;
	n = 1 << (n + 1);
	for(int i = 2; i <= n - 1; ++i) cin >> tr[i];
	dfs(1);
	cout << ans;
}

int main()
{
	ios::sync_with_stdio(0);
//	int TT;cin>>TT;while(TT--)
	work();
	return 0;
}