牛客练习赛 区间的连续段（建图 倍增）

题目连接： https://www.nowcoder.com/acm/contest/82/B
题目思路：首先我们容易想到处理出每个点最远能伸展到哪里，那么就是相当于一个一个连续的点，那么考虑建边，然后倍增就行了
accode

#include<bits/stdc++.h>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 1e6+6;
int n,m,k;
LL a[maxn];
LL sum[maxn];
int p[maxn];
int fa[maxn];
int bz[maxn][31];
int getans(int l,int r)
{
    int ret = 0;
    for(int i = 30;i>=0;i--){
        if(bz[l][i]!=0&&bz[l][i]<=r){
            ret += (1<<i);
            l = bz[l][i];
        }
        if(bz[l][0]==l) return -1;
    }
    return ret+1;
}
int main()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i = 1;i<=n;i++){
        scanf("%lld",&a[i]);
    }
    sum[0] = 0;
    for(int i = 1;i<=n;i++){
        sum[i] = sum[i-1] +a[i];
    }
    sum[n+1] = sum[n]+k;
    for(int i = 1;i<=n;i++){
        p[i] = lower_bound(sum+1,sum+1+n,sum[i-1]+k+1) - sum;
        fa[i] = p[i];
       // cout<<i<<' '<<p[i]<<endl;
    }
    for(int i = 1;i<=n;i++){
        bz[i][0] = fa[i];
    }
    for(int i = 1;i<31;i++){
        for(int j = 1;j<=n;j++){
            bz[j][i] = bz[bz[j][i-1]][i-1];
        }
    }
    while(m--){
        int l,r;
        scanf("%d%d",&l,&r);
        if(l>r){
            swap(r,l);
        }
        int tmp = getans(l,r);
        if(tmp==-1){
            puts("Chtholly");
            continue;
        }
        printf("%d\n",tmp);
    }
}