http://codeforces.com/contest/580/problem/C Kefa and Park

给定一棵树，且根节点为1，树中一些结点有猫，求出所有从根节点到叶节点的路径，且路径上没有连续的m个结点上有猫，直接深搜到叶节点，记录连续的猫的个数，若大于m了则不再往下搜，否则到达叶节点，答案加1，注意读入边。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <list>
using namespace std;
#define MAX 100005
int n, m, x, y, a[MAX], ans;
vector<int> G[MAX];
bool vis[MAX];
void dfs(int c,int v) {
    //cout << v << endl;
    vis[v] = true;
    c += a[v];
    if (!a[v])c = 0;
    if (c > m) return;
    bool f = false;
    for (int i = 0; i < G[v].size(); ++i) {
        int t = G[v][i];
        if (!vis[t])dfs(c, t), f = true;
    }
    if (!f)ans++;
}
int main()
{
//  freopen("a.txt", "r", stdin);
//  freopen("b.txt", "w", stdout);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
    }
    for (int i = 1; i < n; ++i) {
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
        G[y].push_back(x);
    }
    dfs(0, 1);
    cout << ans << endl;
    return 0;
}