poj 1195 Mobile phones（二维树状数组）

Language: Default Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 16910 Accepted: 7799 Description Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and columns numbered from 0 to S-1. Each square contains a base station. The number of active mobile phones inside a square can change because a phone is moved from a square to another or a phone is switched on or off. At times, each base station reports the change in the number of active phones to the main base station along with the row and the column of the matrix.  Write a program, which receives these reports and answers queries about the current total number of active mobile phones in any rectangle-shaped area.  Input The input is read from standard input as integers and the answers to the queries are written to standard output as integers. The input is encoded as follows. Each input comes on a separate line, and consists of one instruction integer and a number of parameter integers according to the following table.  The values will always be in range, so there is no need to check them. In particular, if A is negative, it can be assumed that it will not reduce the square value below zero. The indexing starts at 0, e.g. for a table of size 4 * 4, we have 0 <= X <= 3 and 0 <= Y <= 3.  Table size: 1 * 1 <= S * S <= 1024 * 1024  Cell value V at any time: 0 <= V <= 32767  Update amount: -32768 <= A <= 32767  No of instructions in input: 3 <= U <= 60002  Maximum number of phones in the whole table: M= 2^30  Output Your program should not answer anything to lines with an instruction other than 2. If the instruction is 2, then your program is expected to answer the query by writing the answer as a single line containing a single integer to standard output. Sample Input 0 4 1 1 2 3 2 0 0 2 2 1 1 1 2 1 1 2 -1 2 1 1 2 3 3 Sample Output 3 4

在二维的格子中 进行两种操作 把某个格子中的值增加某一个数 求一个矩形内格子的总和

用一个二维树状数组来求解

因为题目中是从0开始标号的 而树状数组中是从1开始的 所以在输入点的坐标时  要+1

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>
#include <vector>
#include <queue>

#define MEM(a,x) memset(a,x,sizeof a)
#define eps 1e-8
#define MOD 10009
#define MAXN 1500
#define MAXM 100010
#define INF 99999999
#define ll __int64
#define bug cout<<"here"<<endl
#define fread freopen("ceshi.txt","r",stdin)
#define fwrite freopen("out.txt","w",stdout)

using namespace std;

int cnt[MAXN][MAXN];
int s;

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

void update(int x,int y,int num)
{
    for(int i=x;i<=s;i+=lowbit(i))
        for(int j=y;j<=s;j+=lowbit(j))
    {
        cnt[i][j]+=num;
    }
}

int sum(int x,int y)
{
    int num=0;
    for(int i=x;i>0;i-=lowbit(i))
        for(int j=y;j>0;j-=lowbit(j))
    {
        num+=cnt[i][j];
    }
    return num;
}

int main()
{
//    fread;

    while(1)
    {
        int op;
        scanf("%d",&op);
        if(op==3) break;
        if(op==0)
        {
            MEM(cnt,0);
            scanf("%d",&s);
        }
        if(op==1)
        {
            int x,y,num;
            scanf("%d%d%d",&x,&y,&num);
            x++;y++;
            update(x,y,num);
        }
        if(op==2)
        {
            int x1,x2,y1,y2;
            scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
            x1++; x2++; y1++; y2++;
            printf("%d\n",sum(x2,y2)-sum(x1-1,y2)-sum(x2,y1-1)+sum(x1-1,y1-1));
        }
    }
    return 0;
}