码迷,mamicode.com
首页 >  
搜索关键字:largest rectangular    ( 1806个结果
Leetcode-Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [?2,1,?3,4,?1,2,...
分类:其他好文   时间:2014-11-27 06:43:44    阅读次数:162
Leetcode-Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4],t...
分类:其他好文   时间:2014-11-27 01:29:03    阅读次数:187
poj1979 Red and Black【搜索】
点击打开题目 Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 23194   Accepted: 12513 Description There is a rectangular room, covered with squ...
分类:其他好文   时间:2014-11-26 14:24:51    阅读次数:183
poj 1979 Red and Black(dfs)
Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 23191   Accepted: 12510 Description There is a rectangular room, covered with square tiles. Eac...
分类:其他好文   时间:2014-11-25 16:30:39    阅读次数:107
Swap Digits
Description Now we have a number, you can swap any two adjacent digits of it, but you can not swap more than K times. Then, what is the largest probable number that we can get after you...
分类:其他好文   时间:2014-11-25 09:20:31    阅读次数:247
Leetcode-Maximal Rectangle
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.Analysis:For each position (i,j),...
分类:其他好文   时间:2014-11-24 06:28:38    阅读次数:192
[Leetcode] Largest Rectangle in Histogram
Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histog...
分类:其他好文   时间:2014-11-23 17:19:58    阅读次数:254
LeetCode : Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the...
分类:其他好文   时间:2014-11-21 23:06:22    阅读次数:242
poj - 2836 - Rectangular Covering(状态压缩dp)
题意:平面上有 n (2 ≤ n ≤ 15) 个点,现用平行于坐标轴的矩形去覆盖所有点,每个矩形至少盖两个点,矩形面积不可为0,求这些矩形的最小面积。 题目链接:http://poj.org/problem?id=2836 ——>>因为每个矩形至少要盖两个点,所以,枚举所有的两点组合。。 状态:dp[S] 表示将集合 S 中的所有点覆盖的最小矩形面积 状态转移方程:dp[news] = m...
分类:其他好文   时间:2014-11-21 18:50:29    阅读次数:180
LeetCode——Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest ...
分类:其他好文   时间:2014-11-21 18:43:17    阅读次数:196
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!