hdu 4123 Bob’s Race 树的直径+rmq+尺取

Bob’s Race

Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Problem Description

Bob
wants to hold a race to encourage people to do sports. He has got
trouble in choosing the route. There are N houses and N - 1 roads in his
village. Each road connects two houses, and all houses are connected
together. To make the race more interesting, he requires that every
participant must start from a different house and run AS FAR AS POSSIBLE
without passing a road more than once. The distance difference between
the one who runs the longest distance and the one who runs the shortest
distance is called “race difference” by Bob. Bob does not want the “race
difference”to be more than Q. The houses are numbered from 1 to N. Bob
wants that the No. of all starting house must be consecutive. He is now
asking you for help. He wants to know the maximum number of starting
houses he can choose, by other words, the maximum number of people who
can take part in his race.

 

Input

There are several test cases.
The first line of each test case contains two integers N and M. N is the number of houses, M is the number of queries.
The
following N-1 lines, each contains three integers, x, y and z,
indicating that there is a road of length z connecting house x and house
y.
The following M lines are the queries. Each line contains an
integer Q, asking that at most how many people can take part in Bob’s
race according to the above mentioned rules and under the condition that
the“race difference”is no more than Q.

The input ends with N = 0 and M = 0.

(N<=50000 M<=500 1<=x,y<=N 0<=z<=5000 Q<=10000000)

 

Output

For each test case, you should output the answer in a line for each query.

 

Sample Input

5 5
1 2 3
2 3 4
4 5 3
3 4 2
1
2
3
4
5
0 0

 

Sample Output

1
3
3
3
5

 

Source

2011 Asia Fuzhou Regional Contest

题意：给你一个树，求每个点的最远距离，并且最最大的区间长度小于等于q；

思路：1：树的直径

         2：rmq的st表；

　　　3：尺取；

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (4*atan(1.0))
#define eps 1e-14
const int N=1e5+,M=1e6+,inf=1e9+;
const ll INF=1e18+,mod=;
struct is
{
    int v,w,nex;
}edge[N];
int head[N],edg;
int node1,node2,deep;
int dis[N],num[N];
int pos[N];
void init()
{
    memset(num,,sizeof(num));
    memset(head,-,sizeof(head));
    memset(dis,,sizeof(dis));
    edg=;
    deep=;
}
void add(int u,int v,int w)
{
    edg++;
    edge[edg].v=v;
    edge[edg].w=w;
    edge[edg].nex=head[u];
    head[u]=edg;
}
void dfs(int u,int fa,int val,int &node)
{
    dis[u]=max(dis[u],val);
    if(val>deep)
    {
        deep=val;
        node=u;
    }
    for(int i=head[u];i!=-;i=edge[i].nex)
    {
        int v=edge[i].v;
        int w=edge[i].w;
        if(v==fa)continue;
        dfs(v,u,val+w,node);
    }
}
int dpi[N][];
int dpa[N][];
int minn(int x,int y)
{
    return num[x]<=num[y]?x:y;
}
void rmqi(int len)
{
    for(int i=; i<len; i++)
    dpi[i][]=i;
    for(int j=; (<<j)<len; j++)
    for(int i=; i+(<<j)-<len; i++)
    dpi[i][j]=minn(dpi[i][j-],dpi[i+(<<(j-))][j-]);
}
int queryi(int l,int r)
{
    int x=pos[r-l+];
    return minn(dpi[l][x],dpi[r-(<<x)+][x]);
}
int maxx(int x,int y)
{
    return num[x]>=num[y]?x:y;
}
void rmqa(int len)
{
    for(int i=; i<len; i++)
    dpa[i][]=i;
    for(int j=; (<<j)<len; j++)
    for(int i=; i+(<<j)-<len; i++)
    dpa[i][j]=maxx(dpa[i][j-],dpa[i+(<<(j-))][j-]);
}
int querya(int l,int r)
{
    int x=pos[r-l+];
    return maxx(dpa[l][x],dpa[r-(<<x)+][x]);
}
int n,m;
int main()
{
    pos[]=-;
    for(int i=;i<;i++) pos[i]=pos[i>>]+;
    while(~scanf("%d%d",&n,&m))
    {
        if(n==&&m==)break;
        init();
        for(int i=;i<n;i++)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            add(u,v,w);
            add(v,u,w);
        }
        dfs(,-,,node1);
        deep=;
        dfs(node1,-,,node2);
        dfs(node2,-,,node1);
        for(int i=;i<=n;i++)
            num[i]=max(dis[i],num[i]);
        rmqi(n+);
        rmqa(n+);
        while(m--)
        {
            int z;
            scanf("%d",&z);
            int l=,r=,ans=;
            while()
            {
                while(num[querya(l,r)]-num[queryi(l,r)]<=z&&r<=n)r++;
                ans=max(ans,r-l);
                if(r>n)
                    break;
                l++;
            }
            printf("%d\n",ans);
        }
    }
    return ;
}