CF103D Time to Raid Cowavans（分块）

对于b>$\sqrt n$的，暴力跳即可。其他的可以O(n)先类似dp的求出sum[i],表示以i为a的答案，然后O(1)回答询问。于是我们先把所有询问按b排序即可。复杂度$O(n\sqrt n)$

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 300010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,m,a[N],nn;
ll sum[N],ans[N];
struct quer{
    int id,a,b;
}q[N];
inline bool cmp(quer a,quer b){return a.b<b.b;}
inline void calc(int b){
    for(int i=n;i>=1;--i){
        sum[i]=a[i];
        if(i+b<=n) sum[i]+=sum[i+b];
    }
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();for(int i=1;i<=n;++i) a[i]=read();nn=sqrt(n);
    m=read();for(int i=1;i<=m;++i) q[i].a=read(),q[i].b=read(),q[i].id=i;
    sort(q+1,q+m+1,cmp);
    for(int i=1;i<=m;++i){
        if(q[i].b>nn){
            ll res=0;
            for(int j=q[i].a;j<=n;j+=q[i].b) res+=a[j];ans[q[i].id]=res;continue;
        }if(q[i].b!=q[i-1].b) calc(q[i].b);
        ans[q[i].id]=sum[q[i].a];
    }for(int i=1;i<=m;++i) printf("%I64d\n",ans[i]);
    return 0;
}