方法同上题,
对于每一层而言 d[ i ][ j ] 的最优解为max(d[I-1 ][j] , L(I,j),R(i,j));
其中L(i,j)代表从i,j往左走若干位置的最优解。
在这里只讨论L(I,J)的求法。
L(i,j) = max( f[i-1][k] -sum[k] ) +sum[j];(其中dist(i,k)<=最大行走长) 记func(i,j)为 max( f[i-1][j] -sum[j] )对每一层只需用滑动队列维护,就可o(n) 求出每个L(i).
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <deque>
using namespace std;
typedef long long LL;
const int maxn = 105;
const int maxm = 10100;
LL f[maxn][maxm],t[maxn][maxm],L[maxm],R[maxm],n,m,c,d[maxn][maxm];
deque<int> Q;
int Lfunc(int j,int i){
return d[i-1][j] - f[i][j];
}
int Rfunc(int j,int i){
return d[i-1][j] + f[i][j];
}
int main()
{
while(scanf("%lld %lld %lld",&n,&m,&c)==3&&n){
for(int i=1;i<=n+1;i++)
for(int j=0;j<=m;j++){
if(!j) f[i][j] = 0;
else{
scanf("%lld",&f[i][j]);
f[i][j]+=f[i][j-1];
}
}
for(int i=1;i<=n+1;i++)
for(int j=1;j<=m;j++){
if(!j) t[i][j] = 0;
else{
scanf("%lld",&t[i][j]);
t[i][j]+=t[i][j-1];
}
}
for(int i=0;i<=m;i++) d[0][i] = 0;
for(int i=1;i<=n+1;i++){
L[0] = d[i-1][0];
Q.clear(); Q.push_back(0);
for(int j=1;j<=m;j++){
while(!Q.empty()&&t[i][j]-t[i][Q.front()]>c){
Q.pop_front();
}
L[j] = d[i-1][j];
if(!Q.empty()) L[j] =max(L[j],Lfunc(Q.front(),i)+f[i][j]);
while(!Q.empty()&&Lfunc(Q.back(),i)<=Lfunc(j,i)) Q.pop_back();
Q.push_back(j);
}
R[0] = d[i-1][m];
Q.clear(); Q.push_back(m);
for(int j=m-1;j>=0;j--){
while(!Q.empty()&&t[i][Q.front()]-t[i][j]>c) Q.pop_front();
R[j] = d[i-1][j];
if(!Q.empty()) R[j] = Rfunc(Q.front(),i)-f[i][j];
while(!Q.empty()&&Rfunc(Q.back(),i)<=Rfunc(j,i)) Q.pop_back();
Q.push_back(j);
}
for(int j=0;j<=m;j++)
d[i][j] = max(L[j],R[j]);
}
LL res;
for(int i=0;i<=m;i++){
if(!i) res=d[n+1][i];
else res = max(d[n+1][i],res);
}
printf("%lld\n",res);
}
return 0;
}