hdu1892二维树状数组

点击打开链接题目链接

See you~

Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 6024    Accepted Submission(s): 1903

Problem Description

Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good friends. I want to say sorry to Mr, Yin, I must leave now ~~>.<~~. I am very sorry, we could not advanced to the World Finals last year. 
When coming into our training room, a lot of books are in my eyes. And every time the books are moving from one place to another one. Now give you the position of the books at the early of the day. And the moving information of the books the day, your work is to tell me how many books are stayed in some rectangles. 
To make the problem easier, we divide the room into different grids and a book can only stayed in one grid. The length and the width of the room are less than 1000. I can move one book from one position to another position, take away one book from a position or bring in one book and put it on one position. 

 

Input

In the first line of the input file there is an Integer T(1<=T<=10), which means the number of test cases in the input file. Then N test cases are followed. 
For each test case, in the first line there is an Integer Q(1<Q<=100,000), means the queries of the case. Then followed by Q queries. 
There are 4 kind of queries, sum, add, delete and move. 
For example: 
S x1 y1 x2 y2 means you should tell me the total books of the rectangle used (x1,y1)-(x2,y2) as the diagonal, including the two points. 
A x1 y1 n1 means I put n1 books on the position (x1,y1) 
D x1 y1 n1 means I move away n1 books on the position (x1,y1), if less than n1 books at that position, move away all of them. 
M x1 y1 x2 y2 n1 means you move n1 books from (x1,y1) to (x2,y2), if less than n1 books at that position, move away all of them. 
Make sure that at first, there is one book on every grid and 0<=x1,y1,x2,y2<=1000,1<=n1<=100. 

 

Output

At the beginning of each case, output "Case X:" where X is the index of the test case, then followed by the "S" queries. 
For each "S" query, just print out the total number of books in that area. 

 

Sample Input

  
  

   
   2
3
S 1 1 1 1
A 1 1 2
S 1 1 1 1
3
S 1 1 1 1
A 1 1 2
S 1 1 1 2
  
  

 

Sample Output

  
  

   
   Case 1:
1
3
Case 2:
1
4
  
  

 

 

   这是道基础的二维树状数组的题目

   二维数组跟一维的基本相似，具体看博客点击打开链接

基本模板

void update(int x,int y,int w)
{
   for(int i=x;i<=maxn;i=i+lowbit(i))
    for(int j=y;j<=maxn;j=j+lowbit(j))
    c[i][j]=c[i][j]+w;
}
int sum(int x,int y)
{
    int ans=0;
    for(int i=x;i>0;i=i-lowbit(i))
    {
    for(int j=y;j>0;j=j-lowbit(j))
    ans=ans+c[i][j];
    }
    return ans;
}
int getSingle(int x,int y)
{
    return sum(x,y)+sum(x-1,y-1)-sum(x-1,y)-sum(x,y-1);
}

AC代码

#include<iostream>
#include<stdio.h>
#include<string.h>
#define maxn 1010
using namespace std;
int t;
int c[maxn+10][maxn+10];
int x1,y1,x2,y2;
int n1;
int lowbit(int x)
{
    return x&(-x);
}
void update(int x,int y,int w)
{
   for(int i=x;i<=maxn;i=i+lowbit(i))
    for(int j=y;j<=maxn;j=j+lowbit(j))
    c[i][j]=c[i][j]+w;
}
int sum(int x,int y)
{
    int ans=0;
    for(int i=x;i>0;i=i-lowbit(i))
    {
    for(int j=y;j>0;j=j-lowbit(j))
    ans=ans+c[i][j];
    }
    return ans;
}
int getSingle(int x,int y)
{
    return sum(x,y)+sum(x-1,y-1)-sum(x-1,y)-sum(x,y-1);
}
int main()
{
    scanf("%d",&t);
    char s;
    int q;
    for(int o=1;o<=t;o++)
    {
        printf("Case %d:\n",o);
        memset(c,0,sizeof(c));
        for(int i=1;i<=maxn;i++)
        {
            for(int j=1;j<=maxn;j++)
            {
                update(i,j,1);
            }
        }
        scanf("%d",&q);
        while(q--)
        {
            getchar();
            scanf("%c",&s);
            if(s=='S')
            {
                scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
                x1++;
                y1++;
                x2++;
                y2++;
                int xmax=max(x1,x2);
                int xmin=min(x1,x2);
                int ymax=max(y1,y2);
                int ymin=min(y1,y2);
                int ans=sum(xmax,ymax)+sum(xmin-1,ymin-1)-sum(xmax,ymin-1)-sum(xmin-1,ymax);
                printf("%d\n",ans);
            }
            else if(s=='A')
            {
                scanf("%d%d%d",&x1,&y1,&n1);
                x1++;
                y1++;
                update(x1,y1,n1);
            }
            else if(s=='D')
            {
                scanf("%d%d%d",&x1,&y1,&n1);
                x1++;
                y1++;
                int temp=getSingle(x1,y1);
                n1=min(n1,temp);
                update(x1,y1,-n1);
            }
            else if(s=='M')
            {
                cin>>x1>>y1>>x2>>y2>>n1;
                x1++;
                y1++;
                x2++;
                y2++;
                int temp=getSingle(x1,y1);
                n1=min(temp,n1);
                update(x1,y1,-n1);
                update(x2,y2,n1);
            }
        }
    }
    return 0;
}