zoukankan      html  css  js  c++  java
  • USACO Section 5.3 Big Barn(dp)

     USACO前面好像有类似的题目..dp(i,j)=min(dp(i+1,j),dp(i+1,j+1),dp(i,j+1))+1  (坐标(i,j)处无tree;有tree自然dp(i,j)=0) 。dp(i,j)表示以坐标(i,j)为左上角的barn边长最大值,dp(i+1,j),dp(i,j+1)分别表示向右和向下能扩展的最大边长,但是以此为正方形时,右下方的一个格子没有考虑到,所以就+个dp(i+1,j+1)。边界为:dp(i,j)=1(i==n-1或j==n-1)。

    -------------------------------------------------------------------------------

    #include<cstdio>
    #include<iostream>
    #include<algorithm>
    #include<cstring>
    #define rep(i,r) for(int i=0;i<r;i++)
    #define clr(x,c) memset(x,c,sizeof(x))
    #define Rep(i,l,r) for(int i=l;i<r;i++)
    using namespace std;
    const int maxn=1000+5;
    int d[maxn][maxn];
    int ok[maxn][maxn];
    int n;
    int dp(int i,int j) {
    int &ans=d[i][j];
    if(ans>=0) return ans;
    ans=0;
    if(!ok[i][j]) return ans;
    if(i==n-1 || j==n-1) return ans=1;
    return ans=min(dp(i+1,j+1),min(dp(i+1,j),dp(i,j+1)))+1;
    }
    int main()
    {
    freopen("bigbrn.in","r",stdin);
    freopen("bigbrn.out","w",stdout);
    clr(ok,-1);
    int t;
    cin>>n>>t;
    rep(i,t) {
    int a,b;
    scanf("%d%d",&a,&b);
    ok[--a][--b]=0;
    }
    clr(d,-1);
    int ans=0;
    rep(i,n)
       rep(j,n) ans=max(ans,dp(i,j));
       
    cout<<ans<<endl;
    return 0;
    }

    ------------------------------------------------------------------------------- 

    Big Barn
    A Special Treat

    Farmer John wants to place a big square barn on his square farm. He hates to cut down trees on his farm and wants to find a location for his barn that enables him to build it only on land that is already clear of trees. For our purposes, his land is divided into N x N parcels. The input contains a list of parcels that contain trees. Your job is to determine and report the largest possible square barn that can be placed on his land without having to clear away trees. The barn sides must be parallel to the horizontal or vertical axis.

    EXAMPLE

    Consider the following grid of Farmer John's land where `.' represents a parcel with no trees and `#' represents a parcel with trees:

              1 2 3 4 5 6 7 8         1 . . . . . . . .         2 . # . . . # . .         3 . . . . . . . .         4 . . . . . . . .         5 . . . . . . . .         6 . . # . . . . .         7 . . . . . . . .         8 . . . . . . . . 

    The largest barn is 5 x 5 and can be placed in either of two locations in the lower right part of the grid.

    PROGRAM NAME: bigbrn

    INPUT FORMAT

    Line 1:Two integers: N (1 <= N <= 1000), the number of parcels on a side, and T (1 <= T <= 10,000) the number of parcels with trees
    Lines 2..T+1:Two integers (1 <= each integer <= N), the row and column of a tree parcel

    SAMPLE INPUT (file bigbrn.in)

    8 3 2 2 2 6 6 3 

    OUTPUT FORMAT

    The output file should consist of exactly one line, the maximum side length of John's barn.

    SAMPLE OUTPUT (file bigbrn.out)

    5
  • 相关阅读:
    XSS 跨站脚本攻击之构造剖析(一)
    PHP 一个表单多个提交按钮,处理不同的业务逻辑
    Ajax 学习之动态获取,返回服务器的值
    Ajax 学习之获取服务器的值
    Ajax 学习之创建XMLHttpRequest对象------Ajax的核心
    H5开发之Eclipes 编码乱码问题
    PHP 表单提交多行数据,显示多个submit
    PHP 输出表格单元格的数据之用表单的方式;
    PHP 读取逐条数据库记录,以及提交下拉菜单选项
    mysql多个TimeStamp设置(转)
  • 原文地址:https://www.cnblogs.com/JSZX11556/p/4342967.html
Copyright © 2011-2022 走看看