Uva 1484 Alice and Bob's Trip（树形dp）

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4230

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>

#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)

#define bug printf("hihi\n")

#define eps 1e-8

typedef long long ll;

using namespace std;
#define INF 0x3f3f3f3f
#define N 500005

int head[N],num;

struct stud{
  int to,ne,len;
}e[N*2];

int n;

ll le,ri;
ll dp[N][2];

inline void add(int u,int v,int len)
{
    e[num].to=v;
    e[num].len=len;
    e[num].ne=head[u];
    head[u]=num++;
}

void dfs(int u,int pre,int len)  //当前长度为len可以得到的最大值
{
    dp[u][0]=INF;
    dp[u][1]=0;
    bool flag=false;

    for(int i=head[u];i!=-1;i=e[i].ne)
    {
        int to=e[i].to;
        if(to==pre) continue;
        flag=true;
        dfs(to,u,len+e[i].len);
        if(dp[to][1]+e[i].len+len >=le&&dp[to][1]+e[i].len+len<=ri)
            dp[u][0]=min(dp[u][0],dp[to][1]+e[i].len);

        if(dp[to][0]+e[i].len+len>=le&&dp[to][0]+e[i].len+len<=ri)
            dp[u][1]=max(dp[u][1],dp[to][0]+e[i].len);
    }
  if(!flag)
    dp[u][0]=dp[u][1]=0;
}

int main()
{
    int i,j;
    while(~scanf("%d%lld%lld",&n,&le,&ri))
    {
        memset(head,-1,sizeof(head));
        num=0;
        int u,v,len;
        i=n-1;
        while(i--)
        {
            scanf("%d%d%d",&u,&v,&len);
            add(u,v,len);
            add(v,u,len);
        }
        dfs(0,-1,0);
        if(dp[0][1]>=le&&dp[0][1]<=ri)
            printf("%lld\n",dp[0][1]);
        else
            printf("Oh, my god!\n");
    }
    return 0;
}