逐层的找最大面积。

Largest Submatrix

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 967 Accepted Submission(s): 467

Problem Description

Now here is a matrix with letter 'a','b','c','w','x','y','z' and you can change 'w' to 'a' or 'b', change 'x' to 'b' or 'c', change 'y' to 'a' or 'c', and change 'z' to 'a', 'b' or 'c'. After you changed it, what's the largest submatrix with the same letters you can make?

Input

The input contains multiple test cases. Each test case begins with m and n (1 ≤ m, n ≤ 1000) on line. Then come the elements of a matrix in row-major order on m lines each with n letters. The input ends once EOF is met.

Output

For each test case, output one line containing the number of elements of the largest submatrix of all same letters.

Sample Input

2 4
abcw
wxyz

Sample Output

Source

2009 Multi-University Training Contest 7 - Host by FZU

Recommend

gaojie

#include <iostream>

#include <cstdio>

#include <cstring>

using namespace std;

const int N=1005;

char a[N][N];

int high[N];

int C,R;

bool isH(char stc,char c)

{

if(stc=='a')

return c=='a'||c=='w'||c=='y'||c=='z';

if(stc=='b')

return c=='b'||c=='w'||c=='x'||c=='z';

if(stc=='c')

return c=='c'||c=='x'||c=='y'||c=='z';

return false;

}

int main()

{

while(scanf("%d%d",&R,&C)!=EOF)

{

for(int i=0;i<R;i++)

scanf("%s",a);

int ans=-1;

for(char stc='a';stc<='c';stc++)

{

memset(high,0,sizeof(high));

for(int i=0;i<R;i++)

{

for(int j=0;j<C;j++)

{

if(isH(stc,a[j]))

high[j]++;

else

high[j]=0;

}

for(int j=0;j<C;j++)

{

int cnt=1;

if(high[j]==0) continue;

for(int k=j-1;k>=0&&high[k]>=high[j];k--)

cnt++;

for(int k=j+1;k<C&&high[k]>=high[j];k++)

cnt++;

ans=max(ans,high[j]*cnt);

}

printf("%d\n",ans);

}

return 0;

}

转载于:https://www.cnblogs.com/CKboss/archive/2013/06/01/3351046.html

HDOJ 2870 Largest Submatrix相关推荐

笛卡尔树详解带建树模板及例题运用（Largest Submatrix of All 1’s，洗车 Myjnie，Removing Blocks，SPOJ PERIODNI）
文章目录笛卡尔树介绍例题 Largest Submatrix of All 1's 应用「POI2015」洗车 Myjnie [AGC028B] Removing Blocks SPOJ PE ...
【POJ - 3494】Largest Submatrix of All 1’s（加一点思维后化成单调栈）
题干: Given a m-by-n (0,1)-matrix, of all its submatrices of all 1's which is the largest? By largest ...
LeetCode 第 224 场周赛 5655. Largest Submatrix With Rearrangements【动态规划】⭐⭐⭐⭐⭐
文章目录题目描述知识点我的实现码前思考代码实现时空复杂度分析码后反思参考文档题目描述知识点动态规划我的实现码前思考这道题目的motivation跟LeetCode 85非常 ...
HDOJ 动态规划总结
DP是难点,供自已以后系统学习. 1.Robberies 连接 :http://acm.hdu.edu.cn/showproblem.php?pid=2955 背包;第一次做的时候把概率当做背包(放大 ...
HDU OJ 动态规划46题解析
Robberies http://acm.hdu.edu.cn/showproblem.php?pid=2955 背包;第一次做的时候把概率当做背包(放大100000倍化为整数):在此范围内最多能抢 ...
HDU中一些DP的题目分类
DP是难点,供自已以后系统学习. 1.Robberies 连接 :http://acm.hdu.edu.cn/showproblem.php?pid=2955 背包;第一次做的时候把概率当做 ...
动态规划题集（转载）
本内容为转载,原作者不知,如侵权即删. 1.Robberies 连接 :http://acm.hdu.edu.cn/showproblem.php?pid=2955 背包;第一次做的时候把概率当做背包 ...
hdu 动态规划题集
原文链接:http://blog.sina.com.cn/s/blog_6cf509db0100sptt.html点击打开链接 1.Robberies 连接 :http://acm.hdu.edu.c ...
HDU-动态规划题集【转】
DP是难点,供自已以后系统学习. 1.Robberies 连接 :http://acm.hdu.edu.cn/showproblem.php?pid=2955 背包;第一次做的时候把概率当做 ...
有趣的动态规划题目（一）
文章目录 [HDOJ 2084.数塔] [HDOJ 1176.免费馅饼] [HDOJ 1864.最大报销额] [HDOJ 1003.Max Sum] [HDOJ 1506.Largest Rectan ...

HDOJ 2870 Largest Submatrix

Largest Submatrix

HDOJ 2870 Largest Submatrix相关推荐

最新文章

热门文章