二维树状数组--poj1195
来源:互联网 发布:seo why 编辑:程序博客网 时间:2024/05/29 09:12
Language:
Mobile phones
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 13196 Accepted: 6136
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.
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
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 41 1 2 32 0 0 2 2 1 1 1 21 1 2 -12 1 1 2 3 3
Sample Output
34不多说,裸的二维树状数组,维护区间和。下面是代码:#include<iostream>#include<cstring>#include<cstdio>using namespace std;const int MAX=1030;int matri[MAX][MAX];int N;void update(int i,int j,int a){ while(i<=N) { int tmp=j; while(tmp<=N) { matri[i][tmp]+=a; tmp+=tmp&(-tmp); } i+=i&(-i); }}int sum(int x,int y){ int cnt=0; while(x>0) { int tmp=y; while(tmp>0) { cnt+=matri[x][tmp]; tmp-=tmp&(-tmp); } x-=x&(-x); } return cnt;}int main(){ #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); #endif int q; int x,y,a; int x1,y1,x2,y2; while(scanf("%d",&q),q!=3) { if(q==0) { scanf("%d",&N); for(int i=0;i<=N;i++) for(int j=0;j<=N;j++) matri[i][j]=0; } else if(q==1) { scanf("%d%d%d",&x,&y,&a); update(++x,++y,a); } else if(q==2) { scanf("%d%d%d%d",&x1,&y1,&x2,&y2); x1++,y1++,x2++,y2++; printf("%d\n",sum(x2,y2)-sum(x1-1,y2)-sum(x2,y1-1)+sum(x1-1,y1-1)); } } return 0;}
0 0
- poj1195 二维树状数组
- poj1195(二维树状数组)
- 二维树状数组--poj1195
- 二维树状数组poj1195
- poj1195(二维树状数组)
- poj1195之二维树状数组
- poj1195 (二维树状数组)
- Poj1195(二维树状数组)
- poj1195 二维树状数组【pascal】
- POJ1195 Mobile phones, 二维树状数组
- poj1195 Mobile phones 二维树状数组
- POJ1195--Mobile phones--二维树状数组
- poj1195 mobile phones 【二维树状数组】
- poj1195及二维树状数组模板
- POJ1195 Mobile phones 【二维树状数组】
- poj1195--Mobile phones(二维树状数组)
- poj1195 Mobile phones 二维树状数组
- POJ1195 Mobile phones【树状数组】【二维】
- 协调器启动网络(一)
- Codeforces Round #214 (Div. 2) C. Dima and Salad (背包变形)
- springMVC 新特性
- 2013求职面试题
- hibernate学习笔记
- 二维树状数组--poj1195
- 线性表的添加、删除、插入功能的顺序实现
- 算法汇总
- 编程实现strcpy函数
- 设计模式之桥接模式
- 跨域上传的简单例子
- java变量,初始化快,构造函数的执行顺序
- 字符串匹配的KMP算法
- stm32学习笔记(3)就绪表 优先级确定