文件名称:sgu250

  • 所属分类:
  • 数学计算/工程计算
  • 资源属性:
  • [C/C++] [源码]
  • 上传时间:
  • 2015-06-15
  • 文件大小:
  • 1kb
  • 下载次数:
  • 0次
  • 提 供 者:
  • owa***
  • 相关连接:
  • 下载说明:
  • 别用迅雷下载,失败请重下,重下不扣分!

介绍说明--下载内容均来自于网络,请自行研究使用

sgu250:Constructive Plan

题目大意:

给出一个n∗ m的01矩阵,0表示不能放,1表示能放,在其中放入三个矩形,要求满足如下条件:

1.每个矩形面积大于0。

2.这些矩形必须是一个联通块,矩形之间不能重叠。

3.矩形的左边界在同一条线上。

4.中间矩形的横向长度小于两边矩形的横向长度。

求出最大的三个矩形的总面积,无解输出− 1。-250. Constructive Plan



time limit per test: 0.25 sec.

memory limit per test: 65536 KB

input: standard

output: standard







Oh, no! - Petya said, walking around his recently bought ground plot. Petya wants to build a new house on it. According to Petya s building project the house should look above like C character.

There are many trees growing on Petya s plot. But everyone who cuts down a tree in Petya s country is sent to cut down trees for the rest of his life. So first of all Petya has to choose a place for building the house without cutting any tree.

He is feeling that he is not able to find the solution on his own, so he decided to ask you to help him.

The task is simplified a little by the fact that Petya s plot has a rectangular shape of size N*M, divided into 1*1 square cells. For each cell it is known whether there are any trees growing there. House can t occupy cells where trees grow.

Fortunately Petya could explain how his house must look above.

1) H
(系统自动生成,下载前可以参看下载内容)

下载文件列表





sgu250.cpp

相关说明

  • 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
  • 本站是交换下载平台,提供交流渠道,下载内容来自于网络,除下载问题外,其它问题请自行百度更多...
  • 请直接用浏览器下载本站内容,不要使用迅雷之类的下载软件,用WinRAR最新版进行解压.
  • 如果您发现内容无法下载,请稍后再次尝试;或者到消费记录里找到下载记录反馈给我们.
  • 下载后发现下载的内容跟说明不相乎,请到消费记录里找到下载记录反馈给我们,经确认后退回积分.
  • 如下载前有疑问,可以通过点击"提供者"的名字,查看对方的联系方式,联系对方咨询.

相关评论

暂无评论内容.

发表评论

*主  题:
*内  容:
*验 证 码:

源码中国 www.ymcn.org