题目来源:http://ac.jobdu.com/problem.php?pid=1390
本题我用两种方法写了一下,一种是状态压缩,另一种是很简单的斐波那契数,规律其实很简单:
不妨设f(n)为:n时的铺设方式数目,则:
(1)如果第n行是竖着放时,那么它影响到倒数第二行的放置且只有一种情况,即这两列都是竖着放置,占据倒数第二行和最后一行,则剩余n-2行有f(n-2)种;
(2)如果第n行是横着放置时,那么它只影响到本行,且只能横着放,那么剩余n-1行有f(n-1)种情况;
则:f(n) = f(n-1) + f(n-2),其中f(1) = 1, f(2) = 2;
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
LL dp[71];
void Pre_Slove()
{
int i;
dp[1] = 1;
dp[2] = 2;
for(i = 3; i <= 71; ++i)
dp[i] = dp[i-1] + dp[i-2];
}
int main()
{
int n;
Pre_Slove();
while(~scanf("%d", &n))
printf("%lld\n", dp[n]);
return 0;
}
状态压缩方法:
可以参考:http://blog.csdn.net/hearthougan/article/details/22077391
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
int i, n;
LL dp[71][4];
void DFS(int j, int iCurstate, int iPrestate)
{
if(j >= 2)
{
dp[i][iCurstate] += dp[i-1][iPrestate];
return ;
}
if(j + 1 <= 2)
{
DFS(j+1, iCurstate<<1|1, iPrestate<<1);
DFS(j+1, iCurstate<<1, iPrestate<<1|1);
}
if(j + 2 <= 2)
DFS(j+2, iCurstate<<2|3, iPrestate<<2|3);
}
int main()
{
while(~scanf("%d", &n))
{
memset(dp, 0, sizeof(dp));
dp[0][(1<<2)-1] = 1;
for(i = 1; i <= n; ++i)
DFS(0, 0, 0);
printf("%lld\n", dp[n][(1<<2)-1]);
}
return 0;
}