P2254 [NOI2005]瑰丽华尔兹

 https://www.luogu.org/problemnew/show/P2254

总结：单调队列优化；对每行每列更新是使用

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

deque<pair<int,int> >q;
int dp[maxn][maxn];
int dx[5]={0,-1,1,0,0};
int dy[5]={0,0,0,-1,1};
int ans=0;
int n,m;
char mp[maxn][maxn];
void solve(int x,int y,int op,int len)
{
    int now=1;
    q.clear();
    while(x<=n&&y<=m&&x>=1&&y>=1)
    {
        //cout<<x<<" "<<y<<endl;
        if(mp[x][y]!='.') q.clear();
        else
        {
            while(!q.empty()&&q.back().second-q.back().first<=dp[x][y]-now) q.pop_back();
            if(dp[x][y]!=-INF)q.push_back({now,dp[x][y]});
            while(!q.empty()&&now-q.front().first>len) q.pop_front();

            if(!q.empty())
                dp[x][y]=q.front().second+now-q.front().first;
            else dp[x][y]=-INF;

            ans=max(ans,dp[x][y]);
        }
        x+=dx[op];
        y+=dy[op];
        now++;

    }
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int x0,y0,q;
    cin>>n>>m>>x0>>y0>>q;
    for(int i=1;i<=n;i++)
    {
        cin>>(mp[i]+1);
    }

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++) dp[i][j]=-INF;
    }
    dp[x0][y0]=0;

    while(q--)
    {
        int op;
        int s,t;
        cin>>s>>t>>op;
        if(op==1)
        {
            for(int i=1;i<=m;i++) solve(n,i,op,t-s+1);
        }
        else if(op==2)
        {
            for(int i=1;i<=m;i++) solve(1,i,op,t-s+1);
        }
        else if(op==3)
        {
            for(int i=1;i<=n;i++) solve(i,m,op,t-s+1);
        }
        else for(int i=1;i<=n;i++) solve(i,1,op,t-s+1);
        //cout<<ans<<endl;
    }
    /*for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++) ans=max(ans,dp[i][j]);
    }*/
    cout<<ans<<endl;

    return 0;
}