CF479E Riding in a Lift

挺明显的一道前缀和优化dp简单题，但是由于比较菜，写了45分钟才写完，所以记录一下。

分为a<b和a>b两种情况进行dp。

#include <bits/stdc++.h>
using namespace std;
const int N=5e3+5,MOD=1e9+7;
int n,a,b,m,ans;
int f[N],sum[N],g[N];
int main(){
	scanf("%d%d%d%d",&n,&a,&b,&m);
	f[a]=1;
	if (a<b)
	{
		sum[0]=0;
		for (register int i=1; i<b; ++i) sum[i]=(sum[i-1]+f[i])%MOD;
		for (register int i=1; i<b; ++i) g[i]=f[i];
		for (register int i=1; i<=m; ++i)
		{
			for (register int j=1; j<b; ++j) f[j]=((sum[j+(b-j+1)/2-1]-sum[0]-g[j])%MOD+MOD)%MOD;
			sum[0]=0;
			for (register int j=1; j<b; ++j) sum[j]=(sum[j-1]+f[j])%MOD;
			for (register int j=1; j<b; ++j) g[j]=f[j];
		}
		for (register int i=1; i<b; ++i) ans=(ans+f[i])%MOD;
		printf("%d\n",ans); 
	}
	else
	{
		sum[b]=0;
		for (register int i=b+1; i<=n; ++i) sum[i]=(sum[i-1]+f[i])%MOD;
		for (register int i=b+1; i<=n; ++i) g[i]=f[i];
		for (register int i=1; i<=m; ++i)
		{
			for (register int j=b+1; j<=n; ++j) f[j]=((sum[n]-sum[j-(j-b+1)/2]-g[j])%MOD+MOD)%MOD;
			sum[b]=0;
			for (register int j=b+1; j<=n; ++j) sum[j]=(sum[j-1]+f[j])%MOD;
			for (register int j=b+1; j<=n; ++j) g[j]=f[j];
		}
		for (register int i=b+1; i<=n; ++i) ans=(ans+f[i])%MOD;
		printf("%d\n",ans);
	}
return 0;
}