题意:从起点开始最多能向左走L步,最多能向右走R步,问最多能覆盖图上多少个点?
思路:曼哈顿距离的好题。由于从一个点到另一个点,左右的差值是确定的,所以最优的情况一定是和最小的情况。
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int inf = 0x3f3f3f3f;
const int maxn = 2005;
const int maxm = 2005;
char str[maxn][maxm];
int dir[4][2] = { { 1,0 },{-1,0},{0,1},{0,-1} };
int vis[maxn][maxm];
pii dis[maxn][maxm];
deque<pii> que;
int main(){
int n,m,r,c,cl,cr;
scanf("%d%d%d%d%d%d",&n,&m,&r,&c,&cl,&cr);
r--;c--;
for( int i = 0;i < n;i++ ){
for( int j = 0;j < m;j++ ){
dis[i][j] = pii( inf,inf );
}
}
dis[r][c] = { 0,0 };
for( int i = 0;i < n;i++ ){
scanf("%s",str[i]);
}
que.push_back( pii(r,c) );
while( que.size() ){
pii cur = que.front();
int x = cur.first,y = cur.second;
if( vis[x][y] ) continue;
vis[x][y] = 1;
int left = dis[x][y].first;
int right = dis[x][y].second;
que.pop_front();
for( int i = 0;i < 4;i++ ){
int xx = x + dir[i][0];
int yy= y + dir[i][1];
if( xx < 0 || xx >= n || yy < 0 || yy >= m ) continue;
if( str[xx][yy] == '*' ) continue;
int ll = left + ( i == 3 );
int rr = right + ( i == 2 );
if( ll > cl ) continue;
if( rr > cr ) continue;
if( ll + rr < dis[xx][yy].first + dis[xx][yy].second ){
dis[xx][yy] = pii( ll,rr );
if( i == 3 || i == 2 )
que.push_back( pii( xx,yy ) );
else que.push_front( pii(xx,yy) );
}
}
}
int ans= 0;
for( int i = 0;i < n;i++ ){
for( int j = 0;j < m;j++ ){
if( vis[i][j] ) ans++;
}
}
printf("%d\n",ans);
return 0;
}