HDU_5057_分块

http://acm.hdu.edu.cn/showproblem.php?pid=5057

分块，保存每个块中每位对应数字的和，复杂的是getmum，左右下标所在的块不能直接读取block数组，要重新自己计算。

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;

int a[],belong[],L[],R[],block[][][],n,m;
int ten[] = {,,,,,,,,,,};

void build()
{
    int sizee = sqrt(n);
    int num = n/sizee;
    if(n%sizee)  num++;
    for(int i = ;i <= num;i++)
    {
        L[i] = (i-)*sizee+;
        R[i] = i*sizee;
    }
    for(int i = ;i <= n;i++)   belong[i] = (i-)/sizee+;
    for(int i = ;i <= n;i++)
    {
        int temp = a[i];
        for(int j = ;j <= ;j++)
        {
            block[belong[i]][j][temp%]++;
            temp /= ;
        }
    }
}

int getnum(int l,int r,int d,int p)
{
    int ans = ;
    if(belong[l] == belong[r])
    {
        for(int i = l;i <= r;i++)
        {
            if((a[i]/ten[d])% == p) ans++;
        }
        return ans;
    }

    for(int i = belong[l]+;i < belong[r];i++)  ans += block[i][d][p];
    for(int i = l;i <= R[belong[l]];i++)
    {
        if((a[i]/ten[d])% == p) ans++;
    }
    for(int i = L[belong[r]];i <= r;i++)
    {
        if((a[i]/ten[d])% == p) ans++;
    }
    return ans;
}

void update(int x,int y)
{
    for(int i = ;i <= ;i++)
    {
        block[belong[x]][i][a[x]%]--;
        a[x] /= ;
    }
    a[x] = y;
    for(int i = ;i <= ;i++)
    {
        block[belong[x]][i][y%]++;
        y /= ;
    }
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(block,,sizeof(block));
        scanf("%d%d",&n,&m);
        for(int i = ;i <= n;i++)   scanf("%d",&a[i]);
        build();
        char s[];
        while(m--)
        {
            scanf("%s",s);
            if(s[] == 'S')
            {
                int x,y;
                scanf("%d%d",&x,&y);
                update(x,y);
            }
            else
            {
                int l,r,d,p;
                scanf("%d%d%d%d",&l,&r,&d,&p);
                printf("%d\n",getnum(l,r,d,p));
            }
        }
    }
    return ;
}