hdu 6333 莫队算法+组合数学

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const ll maxn=1e5+5;
ll fact[maxn],f[maxn],inv[maxn];
struct node{int l,r,index,block;ll res;}a[maxn];
int t,temp;
void init()
{
    fact[0]=f[0]=inv[1]=inv[0]=1;
    for(int i=2;i<maxn;++i)
        inv[i]=inv[mod%i]*(mod-mod/i)%mod;
    for(int i=1;i<maxn;++i)
    {
        fact[i]=fact[i-1]*i%mod;
        f[i]=f[i-1]*inv[i]%mod;
    }
}
ll solve(ll n,ll m)
{
    if(n<m||n<0||m<0)
        return 0;
    return fact[n]*f[m]%mod*f[n-m]%mod;
}
bool cmp1(node a,node b)
{
    if(a.block!=b.block)
        return a.l<b.l;
    return a.r<b.r;
}
bool cmp2(node a,node b)
{
    return a.index<b.index;
}
int main()
{
    init();
    scanf("%d",&t);
    for(int i=0;i<t;i++)
    {
        scanf("%d%d",&a[i].l,&a[i].r);
        a[i].index=i;
        a[i].res=0;
        a[i].block=a[i].l/((int)(sqrt(maxn)+1));
    }
    sort(a,a+t,cmp1);
    ll ans=0;
    for(int i=0;i<=a[0].r;i++)
        ans=(ans+solve(a[0].l,i))%mod;
    a[0].res=ans;
    int nowl=a[0].l,nowr=a[0].r;
    for(int i=1;i<t;i++)
    {
        while(nowl<a[i].l)
            ans=((ans*2%mod-solve(nowl++,nowr))%mod+mod)%mod;
        while(nowl>a[i].l)
            ans=(ans+solve(--nowl,nowr))%mod*inv[2]%mod;
        while(nowr<a[i].r)
            ans=(ans+solve(nowl,++nowr))%mod;
        while(nowr>a[i].r)
            ans=((ans-solve(nowl,nowr--))%mod+mod)%mod;
        a[i].res=ans;
    }
    sort(a,a+t,cmp2);
    for(int i=0;i<t;i++)
        printf("%lld\n",a[i].res);
    return 0;
}