Codeforces Round #358 (Div. 2) C. Alyona and the Tree（DFS）

题目地址：http://codeforces.com/problemset/problem/682/C

思路：DFS，维护该节点到根节点的距离与该节点到根节点路径上节点距离的最小值，如果dist[v]-minn>a[v]，则return，该子树都不符合条件，否则，计数加一ans++，结果为总节点数-ans。

#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define debu
using namespace std;
typedef long long LL;
const LL INF=1e15;
const int maxn=1e5+50;
struct Node
{
    int v,w;
    Node(int v=0,int w=0):v(v),w(w) {}
};
int n,ans=0;
int a[maxn];
int V[maxn];
LL dist[maxn];
vector<Node>g[maxn];
void solve(int v,LL minn)
{
    if(dist[v]-minn<=a[v]) ans++;
    else return ;
    for(int i=0; i<g[v].size(); i++)
    {
        if(!V[g[v][i].v])
        {
            V[g[v][i].v]=1;
            dist[g[v][i].v]=dist[v]+g[v][i].w;
            solve(g[v][i].v,min(minn,dist[v]));
        }
    }
}
int main()
{
#ifdef debug
    freopen("in.in","r",stdin);
#endif // debug
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
        scanf("%d",&a[i]);
    for(int i=1; i<n; i++)
    {
        int v,w;
        scanf("%d%d",&v,&w);
        g[i+1].push_back(Node(v,w));
        g[v].push_back(Node(i+1,w));
    }
    V[1]=1;
    solve(1,INF);
    printf("%d\n",n-ans);
    return 0;
}