正題

---

題目大意

$n?m$的有障礙物的網格，開始在$(x_s,y_s)$。有$k$段時間網格會傾斜，對于傾斜的方向可以選擇移動或者不移動，求最長移動距離。

---

解題思路

因為每段時間方向唯一，所以我們對于每一列或每一行分開計算，有轉移$$f_i=f_j+i?j(i?j\le t)$$

然后單調隊列轉移即可，時間復雜度$O(nmk)$

---

$code$

#include<cstdio> #include<cstring> #include<algorithm> #include<queue> using namespace std; const int N=210; struct node{int s,t,w; }a[N]; int n,m,sx,sy,k,f[N][N],s[N]; char v[N][N]; deque<int> q; bool cmp(node x,node y) {return x.s<y.s;} int main() {scanf("%d%d%d%d%d",&n,&m,&sx,&sy,&k);for(int i=1;i<=n;i++)scanf("%s",v[i]+1);for(int i=1;i<=k;i++)scanf("%d%d%d",&a[i].s,&a[i].t,&a[i].w);memset(f,0xcf,sizeof(f));s[0]=s[n+1]=-2147483647/3; sort(a+1,a+1+k,cmp);f[sx][sy]=0;for(int p=1;p<=k;p++){int l=a[p].t-a[p].s+1;if(a[p].w==1){for(int j=1;j<=m;j++){while(!q.empty())q.pop_back();q.push_back(0);for(int i=n,fr=0;i>=1;i--,fr++){if(v[i][j]=='x'){while(!q.empty())q.pop_back();continue;}while(!q.empty()&&s[q.back()]+fr<=f[i][j])q.pop_back();s[i]=f[i][j]-fr;q.push_back(i);while(q.front()-i>l)q.pop_front();f[i][j]=s[q.front()]+fr;}}}else if(a[p].w==2){for(int j=1;j<=m;j++){while(!q.empty())q.pop_back();q.push_back(n+1);for(int i=1,fr=0;i<=n;i++,fr++){if(v[i][j]=='x'){while(!q.empty())q.pop_back();continue;}while(!q.empty()&&s[q.back()]+fr<=f[i][j])q.pop_back();s[i]=f[i][j]-fr;q.push_back(i);while(i-q.front()>l)q.pop_front();f[i][j]=s[q.front()]+fr;}}}else if(a[p].w==3){for(int i=1;i<=n;i++){while(!q.empty())q.pop_back();q.push_back(0);for(int j=m,fr=0;j>=1;j--,fr++){if(v[i][j]=='x'){while(!q.empty())q.pop_back();continue;}while(!q.empty()&&s[q.back()]+fr<=f[i][j])q.pop_back();s[j]=f[i][j]-fr;q.push_back(j);while(q.front()-j>l)q.pop_front();f[i][j]=s[q.front()]+fr;}}}else if(a[p].w==4){for(int i=1;i<=n;i++){while(!q.empty())q.pop_back();q.push_back(n+1);for(int j=1,fr=0;j<=m;j++,fr++){if(v[i][j]=='x'){while(!q.empty())q.pop_back();continue;}while(!q.empty()&&s[q.back()]+fr<=f[i][j])q.pop_back();s[j]=f[i][j]-fr;q.push_back(j);while(j-q.front()>l)q.pop_front();f[i][j]=s[q.front()]+fr;}}}}int ans=0;for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)ans=max(ans,f[i][j]);printf("%d",ans); }

總結

以上是生活随笔為你收集整理的jzoj1753-锻炼身体【单调队列】的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。