2021——线段树与树状数组

1.二维线段树 poj1195

Mobile phones

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 25374		Accepted: 11565

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

 

模板题

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int n,m;
const int maxn=1005;
struct node
{
	int l,r,sum;
};
struct node1
{
	int l,r;
	node t[maxn<<2]; 
}tr[maxn<<2];
void sbuild(int l,int r,int now,int k)
{
	tr[k].t[now].l=l; tr[k].t[now].r=r;
	tr[k].t[now].sum=0;
	if(l==r) return;
	int mid=(l+r)>>1;
	sbuild(l,mid,now<<1,k);
	sbuild(mid+1,r,now<<1|1,k);
}
void build(int l,int r,int ll,int rr,int now)
{
	tr[now].l=l; tr[now].r=r;
	sbuild(ll,rr,1,now);
	if(l==r) return;
	int mid=(l+r)>>1;
	build(l,mid,ll,rr,now<<1);
	build(mid+1,r,ll,rr,now<<1|1);
}
void supdate(int y,int val,int now,int k)
{
	tr[k].t[now].sum+=val;
	if(tr[k].t[now].l==tr[k].t[now].r) return;
	int mid=(tr[k].t[now].l+tr[k].t[now].r)>>1;
	if(y<=mid) supdate(y,val,now<<1,k);
	else supdate(y,val,now<<1|1,k);
}
void update(int x,int y,int val,int now)
{
	supdate(y,val,1,now);
	if(tr[now].l==tr[now].r) return;
	int mid=(tr[now].l+tr[now].r)>>1;
	if(x<=mid) update(x,y,val,now<<1);
	else update(x,y,val,now<<1|1);
}
int squery(int l,int r,int now,int k)
{
	if(tr[k].t[now].l==l && tr[k].t[now].r==r)
	{
		return tr[k].t[now].sum;
	}
	int mid=(tr[k].t[now].l+tr[k].t[now].r)>>1;
	if(r<=mid) return squery(l,r,now<<1,k);
	else if(l>mid) return squery(l,r,now<<1|1,k);
	return squery(l,mid,now<<1,k)+squery(mid+1,r,now<<1|1,k);
}
int query(int l,int r,int ll,int rr,int now)
{
	if(tr[now].l==l && tr[now].r==r) return squery(ll,rr,1,now);
	int mid=(tr[now].l+tr[now].r)>>1;
	if(r<=mid) return query(l,r,ll,rr,now<<1);
	else if(l>mid) return query(l,r,ll,rr,now<<1|1);
	return query(l,mid,ll,rr,now<<1)+query(mid+1,r,ll,rr,now<<1|1);
}
int main()
{
	freopen("a.in","r",stdin);
	freopen("a.out","w",stdout);
	while(~scanf("%d",&n))
	{
		if(!n) 
		{
			scanf("%d",&m);
			build(0,m,0,m,1);
		}
		else if(n==1)
		{
			int x,y,k;
			scanf("%d%d%d",&x,&y,&k);
			update(x,y,k,1);
		}
		else if(n==2)
		{
			int x,y,xx,yy;
			scanf("%d%d%d%d",&x,&y,&xx,&yy);
			printf("%d\n",query(x,xx,y,yy,1));
		}
		else break;
	}
	
	return 0;
}

 

2.二维树状数组 poj2029

Get Many Persimmon Trees

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 5303		Accepted: 3405

Description

Seiji Hayashi had been a professor of the Nisshinkan Samurai School in the domain of Aizu for a long time in the 18th century. In order to reward him for his meritorious career in education, Katanobu Matsudaira, the lord of the domain of Aizu, had decided to grant him a rectangular estate within a large field in the Aizu Basin. Although the size (width and height) of the estate was strictly specified by the lord, he was allowed to choose any location for the estate in the field. Inside the field which had also a rectangular shape, many Japanese persimmon trees, whose fruit was one of the famous products of the Aizu region known as 'Mishirazu Persimmon', were planted. Since persimmon was Hayashi's favorite fruit, he wanted to have as many persimmon trees as possible in the estate given by the lord.
For example, in Figure 1, the entire field is a rectangular grid whose width and height are 10 and 8 respectively. Each asterisk (*) represents a place of a persimmon tree. If the specified width and height of the estate are 4 and 3 respectively, the area surrounded by the solid line contains the most persimmon trees. Similarly, if the estate's width is 6 and its height is 4, the area surrounded by the dashed line has the most, and if the estate's width and height are 3 and 4 respectively, the area surrounded by the dotted line contains the most persimmon trees. Note that the width and height cannot be swapped; the sizes 4 by 3 and 3 by 4 are different, as shown in Figure 1.

Figure 1: Examples of Rectangular Estates

Your task is to find the estate of a given size (width and height) that contains the largest number of persimmon trees.

Input

The input consists of multiple data sets. Each data set is given in the following format.

N
W H
x1 y1
x2 y2
...
xN yN
S T

N is the number of persimmon trees, which is a positive integer less than 500. W and H are the width and the height of the entire field respectively. You can assume that both W and H are positive integers whose values are less than 100. For each i (1 <= i <= N), xi and yi are coordinates of the i-th persimmon tree in the grid. Note that the origin of each coordinate is 1. You can assume that 1 <= xi <= W and 1 <= yi <= H, and no two trees have the same positions. But you should not assume that the persimmon trees are sorted in some order according to their positions. Lastly, S and T are positive integers of the width and height respectively of the estate given by the lord. You can also assume that 1 <= S <= W and 1 <= T <= H.

The end of the input is indicated by a line that solely contains a zero.

Output

For each data set, you are requested to print one line containing the maximum possible number of persimmon trees that can be included in an estate of the given size.

Sample Input

16
10 8
2 2
2 5
2 7
3 3
3 8
4 2
4 5
4 8
6 4
6 7
7 5
7 8
8 1
8 4
9 6
10 3
4 3
8
6 4
1 2
2 1
2 4
3 4
4 2
5 3
6 1
6 2
3 2
0

Sample Output

4
3

 

枚举端点+二维树状数组

 

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
const int maxn=205;
int n,w,h;
int c[maxn][maxn];
int lowbit(int x)
{
	return x&(-x);
}
void add(int x,int y)
{
	for(int i=x;i<=w;i+=lowbit(i))
		for(int j=y;j<=h;j+=lowbit(j))
			c[i][j]++;
}
int query(int x,int y)
{
	int res=0;
	for(int i=x;i>0;i-=lowbit(i))
		for(int j=y;j>0;j-=lowbit(j))
			res+=c[i][j];
	return res;
}
int main()
{
	freopen("a.in","r",stdin);
	freopen("a.out","w",stdout);
	while(~scanf("%d",&n) && n)
	{
		scanf("%d%d",&w,&h);
		memset(c,0,sizeof(c));
		for(int i=1;i<=n;i++)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			add(x,y);
		}
		int s,t;
		scanf("%d%d",&s,&t);
		int ans=0;
		for(int i=1;i<=w;i++)
			for(int j=1;j<=h;j++)
				ans=max(ans,query(i,j)+query(i-s,j-t)-query(i-s,j)-query(i,j-t));
		printf("%d\n",ans);
	}
	
	return 0;
}