hdu 1505 dp

2014/9/12

郁闷，tle了两位数，就输入的时候没优化？fky

#include<stdio.h>
#include<string.h>
#include<cmath> 
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
#include<climits>
#include<vector>
using namespace std;
typedef long long ll;  
#define f(x,y,i) for(int i = x;i < y; i++)
#define ff(x,y,i) for(int i = x;i  <= y; i++)
#define F(x,y,i) for(int i = x; i >= y; i--)
#define FF(x,y,i) for(int i = x; i > y; i++)
#define lson pos<<1,l,mid
#define rson pos<<1|1,mid+1,r
#define Min(x,y) x<y?x:y
#define Max(x,y) x>y?x:y
#define sc(n) scanf("%d",&n)
#define pr(n) printf("%d\n",n)
#define met(n,m) memset(n, m, sizeof(n)) 
#define mod 10007
const int N=1050;
int n , tot ,m , k;
   
int s[N][N];
int l[N];
int r[N];
int maxn;
int ae;
char c;

int main()
{
    int cnt = 0;
   scanf("%d",&tot);
    
     while(tot--)
     {
         scanf("%d%d",&n,&m);
         maxn =0;
         int i ,j;
         for(i = 0;i < n; i++)
         {
             for(j = 0; j < m; j++)
             {
                 scanf("%c",&c);
                if(c==' '||c=='\n'||c=='\0')j--;  
                if(c=='R'){s[i][j]=0;continue;}  
                if(i==0&&c=='F'){s[0][j]=1;continue;}  
                if(c=='F')s[i][j]=s[(i-1)][j]+1;  
                     
             }
             
             
             k ;
             l[0]=0;
             r[m-1]=m-1;
             for(j = 1;j < m; j++)
             {
                 k = j;
                 while(k > 0&&s[i][j]<=s[i][k-1]&&s[i][j]>0)k=l[k-1];
                 l[j]=k;
             }
             for(j = m-2;j >= 0; j--)
             {
                 k = j;
                 while(k < n-1&&s[i][j]<=s[i][k+1]&&s[i][j]>0)k=r[k+1];
                 r[j] = k;
             }
             for(j = 0;j < m; j++)
             {
                 ae=(r[j]-l[j]+1)*s[i][j];
                 if(maxn < ae)maxn = ae;
             }
  
         }
         printf("%d\n",maxn*3); 
         
     }
        
    return 0;
}