Codeforces 739B Alyona and a tree

dep[u] >= dep[v]-a[v]，可以用二分在树链上找点u，并维护点u点的前缀和。

代码：

#include<bits/stdc++.h>
//#define make_pair MP
using namespace std;

typedef __int64 ll;
typedef pair<ll, int> PII;
const int MAXN = 2e5+5;
vector<PII> G[MAXN], path;
ll dep[MAXN];
int sum[MAXN], a[MAXN];

void dfs(int u) {
    path.push_back(make_pair(dep[u], u));
    int it = lower_bound(path.begin(), path.end(), make_pair(dep[u]-a[u],-1))-path.begin()-1;
    if(it >= 0) sum[path[it].second]--;
    for(int i = 0; i < G[u].size(); i++) {
        int v = G[u][i].first, w = G[u][i].second;
        dep[v] = dep[u]+w;
        dfs(v);
        sum[u] += sum[v]+1;
    }
    path.pop_back();
}

int main() {
    memset(sum, 0, sizeof(sum));
    int n; cin >> n;
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for(int i = 2; i <= n; i++) {
        int t, w; scanf("%d%d", &t, &w);
        G[t].push_back(make_pair(i, w));
    }
    dep[1] = 0;
    dfs(1);
    for(int i = 1; i <= n; i++) printf("%d ", sum[i]);
    return 0;
}