poj 1964

读数据2小时，解题五分钟

思路：
把每一排都当成一个柱状图最大面积的问题，柱体的高度就是它头上最近的R的位置。(用h[i]表示高度的话赢应该这样写
if (mp[i][j] == ‘F’) h[j]++;
else h[j] = 0;
我相信你看懂了吧)

如果你想通了上一句话，那么你就用柱状图最大面积的问题的单调栈思路去求解，很简单的。

我感觉我做题做多了，表达能力都不行了，说不出来，直接看代码把
（读数据的时候一定要用while读，不然会出问题）

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define IMAX 2147483646
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace std;

int t, n, m;
char mp[1111][1111],tt;
int a[1111], l[1111], r[1111],st[1111],s,ans;

int main() {
	scanf("%d", &t);
	while (t--) {
		//t = 3;
		/*char iname[555] = "";
		char oname[555] = "";
		sprintf(iname, "_%d.in", t + 1);
		sprintf(oname, "_%d.out", t + 1);
		freopen(iname, "r", stdin);*/

		scanf("%d%d", &n, &m);
		getchar();
		for (int i = 1; i <= n; i++) 
			for (int j = 1; j <= m; j++) {
				do tt = getchar();
				while (tt != 'F'&&tt != 'R');
				mp[i][j] = tt;
			}
		
		memset(a, 0, sizeof(a));
		ans = 0;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++)
				if (mp[i][j] == 'F')a[j]++;
				else a[j] = 0;
			s = 0;
			for (int j = 1; j <= m; j++) {
				while (s > 0 && a[st[s - 1]] >= a[j])s--;
				l[j] = (s == 0) ? 1 : st[s - 1] + 1;
				st[s++] = j;
			}
			s = 0;
			for (int j = m; j >= 1; j--) {
				while (s > 0 && a[st[s - 1]] >= a[j])s--;
				r[j] = (s == 0) ? m : st[s - 1] - 1;
				st[s++] = j;
			}
			for (int j = 1; j <= m; j++)
				ans = max(ans, a[j] * (r[j] - l[j] + 1));
		}
		/*ans *= 3;
		FILE *fp = fopen(oname, "r");
		int tans = 0;
		fscanf(fp, "%d", &tans);
		fclose(fp);
		if (tans != ans) 
			printf("case:%d: %d %d\n", t + 1, tans, ans);*/
		printf("%d\n", ans*3);
		//break;
	}