zoukankan      html  css  js  c++  java
  • POJ 2029 Get Many Persimmon Trees

    Get Many Persimmon Trees
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 3160   Accepted: 2057

    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. 


    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
    题目大意:在一个w*h的矩阵中有n棵柿子树,用一个在这个矩阵中找出一个s*t的子矩阵,使得其中的柿子树最多。
    解题方法:二维树状数组。
    #include <stdio.h>
    #include <iostream>
    #include <string.h>
    using namespace std;
    
    int maze[105][105];
    int w, h;
    
    int lowbit(int x)
    {
        return x & -x;
    }
    
    void update(int x, int y)
    {
        for (int i = x; i <= w; i += lowbit(i))
        {
            for (int j = y; j <= h; j += lowbit(j))
            {
                maze[i][j]++;
            }
        }
    }
    
    int GetSum(int x, int y)
    {
        int sum = 0;
        for (int i = x; i >= 1; i -= lowbit(i))
        {
            for (int j = y; j >= 1; j -= lowbit(j))
            {
                sum += maze[i][j];
            }
        }
        return sum;
    }
    
    int main()
    {
        int n;
        int s, t, ans;
        while(scanf("%d", &n) != EOF && n != 0)
        {
            ans = -1;
            memset(maze, 0, sizeof(maze));
            scanf("%d%d", &w, &h);
            int x, y;
            for (int i = 0; i < n; i++)
            {
                scanf("%d%d", &x, &y);
                update(x, y);
            }
            scanf("%d%d", &s, &t);
            for (int i = s; i <= w; i++)
            {
                for (int j = t; j <= h; j++)
                {
                    ans = max(ans, GetSum(i, j) - GetSum(i - s, j) - GetSum(i, j - t) + GetSum(i - s, j - t));
                }
            }
            printf("%d
    ", ans);
        }
        return 0;
    }
  • 相关阅读:
    CentOS 7 上安装vim(默认未安装)
    SecureCRT8.3+SecureCRT_keygen完成注册
    vi/vim编辑器使用方法详解
    linux系统中如何进入退出vim编辑器,方法及区别
    centos7配置IP地址
    Linux入门基础教程
    【PHP 基础类库】Prototype 原型版教学文章!
    【PHP 模板引擎】Prototype 原型版发布!
    【JavaScript 封装库】BETA 5.0 测试版发布!
    【JavaScript 封装库】Prototype 原型版发布!
  • 原文地址:https://www.cnblogs.com/lzmfywz/p/3230235.html
Copyright © 2011-2022 走看看