hdu 5057 块状链表

没有插入和删除操作...

所以还是很好写的，分块暴力就好了。

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

const int N = 400;
const int M = 11;
int b[N * N];
int cnt[N][M][M];
int w[M];
int h[M];
int n, m, ps;

void init()
{
    w[0] = 1;
    for ( int i = 1; i < M - 1; i++ )
    {
        w[i] = w[i - 1] * 10;
    }
}

int judge( int val, int d, int p )
{
    if ( val / w[d - 1] % 10 == p ) return 1;
    return 0;
}

void update( int cur, int val, int f )
{
    for ( int i = 1; i < M; i++ )
    {
        h[i] = val % 10;
        val = val / 10;
    }
    for ( int i = 1; i < M; i++ )
    {
        cnt[cur][i][h[i]] += f;
    }
}

void modify( int pos, int val )
{
    int cur = pos / ps;
    update( cur, b[pos], -1 );
    b[pos] = val;
    update( cur, b[pos], 1 );
}

int query( int l, int r, int d, int p )
{
    int cur = l / ps, ncur = r / ps;
    int ans = 0;
    for ( int i = cur + 1; i <= ncur - 1; i++ )
    {
        ans += cnt[i][d][p];        
    }
    if ( cur != ncur )
    {
        cur = ( cur + 1 ) * ps;
        for ( int j = l; j < cur; j++ )
        {
            ans += judge( b[j], d, p );
        }
        ncur = ncur * ps;
        for ( int j = ncur; j <= r; j++ )
        {
            ans += judge( b[j], d, p );
        }
    }
    else
    {
        for ( int j = l; j <= r; j++ )
        {
            ans += judge( b[j], d, p );
        }
    }
    return ans;
}

int main ()
{
    init();
    int t;
    scanf("%d", &t);
    while ( t-- )
    {
        scanf("%d%d", &n, &m);
        ps = 350;
        memset( cnt, 0, sizeof(cnt) );
        for ( int i = 0; i < n; i++ )
        {
            scanf("%d", b + i);
            update( i / ps, b[i], 1 );
        }
        while ( m-- )
        {
            char op[2];
            scanf("%s", op);
            if ( op[0] == 'S' )
            {
                int x, y;
                scanf("%d%d", &x, &y);
                x--;
                modify( x, y );
            }
            else
            {
                int l, r, d, p;
                scanf("%d%d%d%d", &l, &r, &d, &p);
                l--;
                r--;
                printf("%d
", query( l, r, d, p ));
            }
        }
    }
    return 0;
}