zoj1716 Get Many Persimmon Trees
2015-07-24 19:33
435 查看
Get Many Persimmon Trees
Submit Status
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
Source
Asia 2003, Aizu (Japan), Japan Domestic
分析:
暴力即可。时间复杂度=100*100*100*100=10^8=1s。而题目给的时间是2s,应该是有可能水过的,于是纯暴力试了一下,确实过了。
很简单。
ac代码:
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[105][105];
int main()
{
int n,w,h,s,t,x,y;
int i,j;
int count,maxn;
while(scanf("%d",&n)&&n!=0)
{
memset(a,0,sizeof(a));
scanf("%d%d",&w,&h);
for(i=0;i<n;i++)
{
scanf("%d%d",&x,&y);
a[x][y]=1;
}
scanf("%d%d",&s,&t);
maxn=0;count=0;
for(i=1;i<=w-s+1;i++)
for(j=1;j<=h-t+1;j++)
{
for(x=i;x<=i+s-1;x++)
for(y=j;y<=j+t-1;y++)
{
if(a[x][y]==1)
{
count++;
}
}
maxn=(maxn>count)?maxn:count;
count=0;
}
printf("%d\n",maxn);
}
return 0;
}
Time Limit: 2000MS | Memory Limit: 65536KB | 64bit IO Format: %lld & %llu |
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
Source
Asia 2003, Aizu (Japan), Japan Domestic
分析:
暴力即可。时间复杂度=100*100*100*100=10^8=1s。而题目给的时间是2s,应该是有可能水过的,于是纯暴力试了一下,确实过了。
很简单。
ac代码:
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[105][105];
int main()
{
int n,w,h,s,t,x,y;
int i,j;
int count,maxn;
while(scanf("%d",&n)&&n!=0)
{
memset(a,0,sizeof(a));
scanf("%d%d",&w,&h);
for(i=0;i<n;i++)
{
scanf("%d%d",&x,&y);
a[x][y]=1;
}
scanf("%d%d",&s,&t);
maxn=0;count=0;
for(i=1;i<=w-s+1;i++)
for(j=1;j<=h-t+1;j++)
{
for(x=i;x<=i+s-1;x++)
for(y=j;y<=j+t-1;y++)
{
if(a[x][y]==1)
{
count++;
}
}
maxn=(maxn>count)?maxn:count;
count=0;
}
printf("%d\n",maxn);
}
return 0;
}
相关文章推荐
- 「深入 Exchange 2013」15 TLS传输层安全
- 编程笔记2:PHPMail
- About LabView
- zoj 1562 Oil Deposits (DFS)
- MFC中ListControl的使用
- 关于中国剩余定理的一种证明
- About LabView
- OC中的迭代器 值对象(把基本数据类型转化为对象类型)
- IOS UIFont可选字体
- CodeForces#313 A. Currency System in Geraldion
- 模仿QQ侧滑菜单实现生日快乐祝福软件
- Xutils框架的使用
- 静态网页实训一
- B - Networking - poj 1287
- 阿里巴巴面经
- android 手机获取外置SD卡路径
- java多线程
- hdu 1010 Tempter of the Bone (DFS)
- UVA-10129 Play on Words
- Docker 生成Node.js web app(含端口映射)