POJ 2029 Get Many Persimmon Trees
来源:互联网 发布:2017淘宝骗保师 编辑:程序博客网 时间:2024/05/20 06:26
Get Many Persimmon Trees
Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 3243Accepted: 2113
3
二维树状数组。。。。树状数组扩展到二维果然很容易啊。。。
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.
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.
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
43
Source
Japan 2003 Domestic二维树状数组。。。。树状数组扩展到二维果然很容易啊。。。
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int tree[200][200];
int N,M,num;
inline int lowbit(int x) {return x&(-x);}
void add(int addx,int addy,int addv)
{
int temp=addy;
while(addx<=N)
{
addy=temp;
while(addy<=M)
{
tree[addx][addy]+=addv;
addy+=lowbit(addy);
}
addx+=lowbit(addx);
}
}
int sum(int x,int y)
{
int ans=0,temp=y;
while(x>0)
{
y=temp;
while(y>0)
{
ans+=tree[x][y];
y-=lowbit(y);
}
x-=lowbit(x);
}
return ans;
}
int Getsum(int x1,int y1,int x2,int y2)
{
return sum(x2,y2)-sum(x2,y1-1)-sum(x1-1,y2)+sum(x1-1,y1-1);
}
int main()
{
while(scanf("%d",&num)!=EOF&&num)
{
memset(tree,0,sizeof(tree));
scanf("%d%d",&N,&M);
while(num--)
{
int a,b;
scanf("%d%d",&a,&b);
add(a,b,1);
}
int r,c,ans=0;
scanf("%d%d",&r,&c);
for(int i=1;i+r-1<=N;i++)
{
for(int j=1;j+c-1<=M;j++)
{
ans=max(Getsum(i,j,i+r-1,j+c-1),ans);
}
}
printf("%d\n",ans);
}
return 0;
}
* This source code was highlighted by YcdoiT. ( style: Codeblocks )#include <cstdio>
#include <cstring>
using namespace std;
int tree[200][200];
int N,M,num;
inline int lowbit(int x) {return x&(-x);}
void add(int addx,int addy,int addv)
{
int temp=addy;
while(addx<=N)
{
addy=temp;
while(addy<=M)
{
tree[addx][addy]+=addv;
addy+=lowbit(addy);
}
addx+=lowbit(addx);
}
}
int sum(int x,int y)
{
int ans=0,temp=y;
while(x>0)
{
y=temp;
while(y>0)
{
ans+=tree[x][y];
y-=lowbit(y);
}
x-=lowbit(x);
}
return ans;
}
int Getsum(int x1,int y1,int x2,int y2)
{
return sum(x2,y2)-sum(x2,y1-1)-sum(x1-1,y2)+sum(x1-1,y1-1);
}
int main()
{
while(scanf("%d",&num)!=EOF&&num)
{
memset(tree,0,sizeof(tree));
scanf("%d%d",&N,&M);
while(num--)
{
int a,b;
scanf("%d%d",&a,&b);
add(a,b,1);
}
int r,c,ans=0;
scanf("%d%d",&r,&c);
for(int i=1;i+r-1<=N;i++)
{
for(int j=1;j+c-1<=M;j++)
{
ans=max(Getsum(i,j,i+r-1,j+c-1),ans);
}
}
printf("%d\n",ans);
}
return 0;
}
0 0
- POJ 2029 Get Many Persimmon Trees
- Poj 2029 Get Many Persimmon Trees
- POJ 2029 Get Many Persimmon Trees [dp]
- POJ 2029 Get Many Persimmon Trees (标记)
- POJ 2029 Get Many Persimmon Trees
- poj-2029-Get Many Persimmon Trees-预处理
- POJ 2029 Get Many Persimmon Trees
- poj 2029 Get Many Persimmon Trees
- poj 2029 Get Many Persimmon Trees
- POJ 2029 Get Many Persimmon Trees
- POJ 2029 Get Many Persimmon Trees
- POJ 2029--Get Many Persimmon Trees +DP
- poj 2029 Get Many Persimmon Trees
- POJ 2029 Get Many Persimmon Trees
- poj 2029 Get Many Persimmon Trees
- POJ 2029 Get Many Persimmon Trees
- poj 2029 Get Many Persimmon Trees
- poj- 2029 -Get Many Persimmon Trees (DP)
- POJ 1260 Pearls
- Spread Studio中文支持图解
- 自定义取值距离的javascript random()函数
- HDOJ 3555 Bomb
- Spread for ASP.NET 7新功能使用指南
- POJ 2029 Get Many Persimmon Trees
- iOS多线程实现3种方式
- XDU 1161 - 科协的数字游戏II
- Spread for Windows Forms 7新功能使用指南
- XDU 1160 - 科协的数字游戏I
- HDOJ 3652 B-number
- Spread for WPF-Silverlight 新功能使用指南
- Spread for WinRT 7新功能使用指南
- CodeForces 55D Beautiful numbers
原创粉丝点击
热门IT博客
热门问题
老师的惩罚
人脸识别
我在镇武司摸鱼那些年
重生之率土为王
我在大康的咸鱼生活
盘龙之生命进化
天生仙种
凡人之先天五行
春回大明朝
姑娘不必设防,我是瞎子
平板支撑练什么
平板支撑瘦肚子
新型建筑模板支撑
新型建筑模板支撑架
新型建筑模板支撑体系
支教
乡村支教
支教申请
支教的意义
乡村男支教
支教心得
中国支教网
支教小山村
支教网
大学生支教
支教工资
短期支教
新疆支教
山区支教
中华支教
乡村支教杨羽全章免费阅读
乡村支教杨羽
我做禽兽支教史
支教的那些日子
穷山沟支教玩小女生
千万不要去支教
支教需要什么条件
杨羽支教浴女村全文
我的支教生涯
乡村支教杨羽全章阅读
支教是什么意思
支教小山村秦天君
支教工资一般多少
乡村支教杨羽全章免费
村中支教那些年
林雨和老公支教免费阅读
面料支数
床单面料支数40还是60好
玫瑰支数代表的意思
玫瑰花支数的含义
手机支架