hdu1505 dp入门
hdu1505
如果没有做过hdu1506,建议先去做那道题,1506是一维,而1505的升级版二维。
题意 : 就是给你一张图,F表示空地,R表示非空题,将空地连成一片,图案一定要是矩形,求最大面积。。
分析:将二维转为一维,将每一行作为x轴,计算每个点的高度,之后的做法就与1506差不多了。
我的做法是先纵向用dp计算高度,在转为一维开始横向dp。。。我有看到一些代码,是在输入时就开始计算高度,一个人看吧。。。
提示:输入比较坑, 它字符与字符之间不一定只有一个空格, 推荐输入格式
for(i = 1; i <= N; i++)
{
for(j = 1; j <= M; j++)
{
scanf("%s", str);
if(str[0] == 'F') maza[i][j] = 'F';
else maza[i][j] = 'R';
}
}
除了输入,其他就差不多了。。^^
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstring>
#define Max 2900
using namespace std;
struct Node
{
int n, s;
bool vis;
}point[Max][Max];
int ll[Max], rr[Max], maxsum;
char maza[Max][Max];
int main()
{
int T;
int N, M;
int i, j, k, a, b;
char str[10];
scanf("%d", &T);
while(T--)
{
scanf("%d%d", &N, &M);
for(i = 1; i <= N; i++)
{
for(j = 1; j <= M; j++)
{
scanf("%s", str);
if(str[0] == 'F') maza[i][j] = 'F';
else maza[i][j] = 'R';
}
}
for(i = 1; i <= M; i++)
{
for(j = 1; j <= N; j++)
{
k = j;
if(maza[j][i] != 'F')
{
point[j][i].n = 0;
continue;
}
while(k > 1 && maza[k-1][i] == 'F')
k = point[k-1][i].n;
point[j][i].n = k;
}
for(j = N; j > 0; j--)
{
k = j;
if(maza[j][i] != 'F')
{
point[j][i].s = 0;
continue;
}
while(k < N && maza[k+1][i] == 'F')
k = point[k+1][i].s;
point[j][i].s = k;
}
}
maxsum = 0;
for(i = 1; i <= N; i++)
{
for(j = 1; j <= M; j++)
{
if(maza[i][j] != 'F') continue;
a = point[i][j].n;
b = point[i][j].s;
k = j;
while(k > 1 && a >= point[i][k-1].n && b <= point[i][k-1].s)
k = ll[k-1];
ll[j] = k;
}
for(j = M; j > 0; j--)
{
if(maza[i][j] != 'F') continue;
a = point[i][j].n;
b = point[i][j].s;
k = j;
while(k < M && a >= point[i][k+1].n && b <= point[i][k+1].s)
k = rr[k+1];
rr[j] = k;
}
for(j = 1; j <= M; j++)
{
if(maza[i][j] != 'F') continue;
a = rr[j] - ll[j] + 1;
b = point[i][j].s - point[i][j].n + 1;
maxsum = max(maxsum, a*b*3);
}
}
cout << maxsum << endl;
}
return 0;
}