10.17_T3 地主

题目

解题思路：

dp
转移方程：
$1.f[i][k][0]+=f[i-1][k-2][0]$
$2.f[i][k][0]+=f[i-1][k-2][1]$
$3.f[i][k][0]+=f[i-1][k-1][0]\ast 2$
$4.f[i][k][0]+=f[i-1][k-1][1]\ast 2$
$5.f[i][k][0]+=f[i-1][k][0]$
然后再%YMW模数
$6.f[i][k][1]+=f[i-1][k-1][0]$
$7.f[i][k][1]+=f[i-1][k-1][1]$
$8.f[i][k][1]+=f[i-1][k][0]\ast 2$
$9.f[i][k][1]+=f[i-1][k][1]$
然后再%YMW模数
然后这题
我还要
%%%%%%%超级巨佬

Accepted code：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int YMW = 100000007;//顺便可以膜拜大佬
const int N = 1005;
long long f[N][N << 1][2], n, d;

inline int Min(int x, int y) {return x < y ? x : y;}

int main() {
    scanf("%d%d", &n, &d);
    f[1][2][0] = f[1][1][1] = 1;
    for (int i = 2; i <= n; ++i)
    	for (int k = 1; k <= Min((i << 1), d); ++k) {
	 		f[i][k][0] += f[i - 1][k - 2][0];
			f[i][k][0] += f[i - 1][k - 2][1];
			f[i][k][0] += f[i - 1][k - 1][1] << 1;
			f[i][k][0] += f[i - 1][k - 1][0] << 1;
			f[i][k][0] += f[i - 1][k][0];
			f[i][k][0] %= YMW;
			f[i][k][1] += f[i - 1][k - 1][0];
			f[i][k][1] += f[i - 1][k - 1][1];
			f[i][k][1] += f[i - 1][k][0] << 1;
			f[i][k][1] += f[i - 1][k][1];
			f[i][k][1] %= YMW;

		}
    printf("%lld\n", (f[n][d][0] + f[n][d][1]) % YMW);
    return 0;
}

转载于:https://www.cnblogs.com/Juruo-HJQ/p/9821830.html