hdu 5057（树状数组+离线处理）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5057

Argestes and Sequence

Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 569    Accepted Submission(s): 144

Problem Description

Argestes has a lot of hobbies and likes solving query problems especially. One day Argestes came up with such a problem. You are given a sequence a consisting of N nonnegative integers, a[1],a[2],...,a[n].Then there are M operation on the sequence.An operation can be one of the following:
S X Y: you should set the value of a[x] to y(in other words perform an assignment a[x]=y).
Q L R D P: among [L, R], L and R are the index of the sequence, how many numbers that the Dth digit of the numbers is P.
Note: The 1st digit of a number is the least significant digit.

 

Input

In the first line there is an integer T , indicates the number of test cases.
For each case, the first line contains two numbers N and M.The second line contains N integers, separated by space: a[1],a[2],...,a[n]—initial value of array elements.
Each of the next M lines begins with a character type.
If type==S,there will be two integers more in the line: X,Y.
If type==Q,there will be four integers more in the line: L R D P.

[Technical Specification]
1<=T<= 50
1<=N, M<=100000
0<=a[i]<=$2^{31}$ - 1
1<=X<=N
0<=Y<=$2^{31}$ - 1
1<=L<=R<=N
1<=D<=10
0<=P<=9

 

Output

For each operation Q, output a line contains the answer.

 

Sample Input

  
  

   
   1
5 7
10 11 12 13 14
Q 1 5 2 1
Q 1 5 1 0
Q 1 5 1 1
Q 1 5 3 0
Q 1 5 3 1
S 1 100
Q 1 5 3 1
  
  

 

Sample Output

  
  

   
   5
1
1
5
0
1
  
  

 

Source

BestCoder Round #11 (Div. 2)

思路：做一第一遍的时候用线段树卡空间，后来网上学了别人的离线处理技巧，用树状数组做了一遍；

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
const int N=1e5+1000;
using namespace std;

int a[N],c[N][12],ans[N];
int b[N];
int T,n,m;

struct node
{
 int kind,l,r,d,p,pos,value;
}op[N];

int lowbit(int x)
{
    return x&(-x);
}

void update(int kind,int x,int p)
{
 while(x<=n)
 {
   if(kind==1)
      c[x][p]++;
   else
      c[x][p]--;
   x+=lowbit(x);
 }
}

int getsum(int x,int p)
{
  int ans=0;
  while(x>0)
  {
    ans+=c[x][p];
    x-=lowbit(x);
  }
  return ans;
}

int pow(int a,int b)
{
 int ans=1;
 for(int i=1;i<=b;i++)
    ans=ans*a;
 return ans;
}

int main()
{

    scanf("%d",&T);
    while(T--)
    {
     scanf("%d%d",&n,&m);

     for(int i=1;i<=n;i++)
     {
        scanf("%d",&a[i]);
        b[i]=a[i];
     }

     for(int i=1;i<=m;i++)
     {
       char s[10];
       int l,r,d,p;
       scanf("%s",s);
       if(s[0]=='Q')
       {
        scanf("%d%d%d%d",&l,&r,&d,&p);
        op[i].kind=1;
        op[i].l=l;
        op[i].r=r;
        op[i].d=d;
        op[i].p=p;
       }
       else if(s[0]=='S')
       {
         scanf("%d%d",&l,&r);
         op[i].kind=0;
         op[i].pos=l;
         op[i].value=r;
       }
     }
     for(int i=1;i<=10;i++)
     {
       memset(c,0,sizeof(c));
       for(int j=1;j<=n;j++)
       {
        a[j]=b[j];
        int t=a[j]/pow(10,i-1)%10;

        update(1,j,t);

       }

       for(int j=1;j<=m;j++)
        {
        if(op[j].kind==0)
        {
         int t=a[op[j].pos]/pow(10,i-1)%10;
         update(0,op[j].pos,t);
             t=op[j].value/pow(10,i-1)%10;
         update(1,op[j].pos,t);
         a[op[j].pos]=op[j].value;
        }
        else
        {
          if(op[j].d==i)
                ans[j]=getsum(op[j].r,op[j].p)-getsum(op[j].l-1,op[j].p);
        }
       }
     }
     for(int i=1;i<=m;i++)
        if(op[i].kind==1)printf("%d\n",ans[i]);

    }
    return 0;
}