C操作,直接修改高度
S,B操作,开一个bool数组记录能否滑行,暴力维护
Q操作,直接记忆化搜索
由于S,B,Q的总数<=100,所以不会超时
下附AC代码:
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int ans,dp[1000][1000],a[1000][1000],f[1000][1000],dx[5],dy[5];
char ch;
int dfs(int x,int y){
if (dp[x][y]) return dp[x][y];
if (!f[x][y]) return 0;
int i,t=0,tmp;
for (i=1; i<=4; i++){
int xx,yy;
xx=x+dx[i]; yy=y+dy[i];
if (f[xx][yy] && a[xx][yy]<a[x][y]){
tmp=dfs(xx,yy);
if (tmp>t) t=tmp;
}
}
dp[x][y]=t+1; return dp[x][y];
}
int main(){
int n,i,j;
scanf("%d",&n);
for (i=1; i<=n; i++)
for (j=1; j<=n; j++){
scanf("%d",&a[i][j]);
f[i][j]=1;
}
dx[1]=-1; dy[1]=0;
dx[2]=1; dy[2]=0;
dx[3]=0; dy[3]=-1;
dx[4]=0; dy[4]=1;
int m,x,x1,x2,y,y1,y2,u;
scanf("%d",&m);
while (m){
scanf("%c",&ch);
switch (ch){
case 'B':m--;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
for (i=x1; i<=x2; i++)
for (j=y1; j<=y2; j++) f[i][j]=1;
break;
case 'C':m--;
scanf("%d%d%d",&x,&y,&u);
a[x][y]=u;
break;
case 'Q':m--;
ans=0; memset(dp,0,sizeof(dp));
for (i=1; i<=n; i++)
for (j=1; j<=n; j++) if (!dp[i][j]){
dp[i][j]=dfs(i,j);
if (dp[i][j]>ans) ans=dp[i][j];
}
printf("%d\n",ans);
break;
case 'S':m--;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
for (i=x1; i<=x2; i++)
for (j=y1; j<=y2; j++) f[i][j]=0;
break;
}
}
return 0;
}
2015.2.11
by lych