第三题:T3三排地砖
标签:递推、数学
题意:有一条由
n
×
3
n×3
n×3个方格组成的道路,求用
1
×
2
1×2
1×2规格的地砖去铺,有多少种方案。(方案数可能很大,输出它对
1
0
9
+
7
10^9+7
109+7取余之后的值)(
1
<
=
n
<
=
200000
1<=n<= 200000
1<=n<=200000)
题解:列一下前几项,
d
p
[
0
]
=
1
,
d
p
[
2
]
=
3
,
d
p
[
4
]
=
11...
dp[0]=1,dp[2]=3,dp[4]=11...
dp[0]=1,dp[2]=3,dp[4]=11...,能推出递推式:
d
p
[
i
]
=
(
d
p
[
i
−
2
]
+
2
∗
(
d
p
[
0
]
+
d
p
[
2
]
+
.
.
.
+
d
p
[
i
−
2
]
)
)
dp[i] = (dp[i-2] + 2 * (dp[0] + dp[2] + ... + dp[i-2])) % mod;
dp[i]=(dp[i−2]+2∗(dp[0]+dp[2]+...+dp[i−2]))
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 10;
ll n, dp[N];
int main() {
dp[0] = 1; dp[2] = 3;
ll sum = 2 * (dp[0] + dp[2]);
cin >> n;
for (int i = 4; i <= n; i += 2) {
dp[i] = (dp[i - 2] + sum) % mod;
sum = (sum + 2 * dp[i]) % mod;
}
cout << dp[n];
return 0;
}
或者递推式: d p [ n ] = 4 ∗ d p [ n − 1 ] − d p [ n − 2 ] ( d p [ 0 ] = 1 , d p [ 1 ] = 1 ) dp[n]=4*dp[n-1]-dp[n-2](dp[0]=1,dp[1]=1) dp[n]=4∗dp[n−1]−dp[n−2](dp[0]=1,dp[1]=1)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 10;
const ll mod = 1e9 + 7;
ll n, a[N];
int main() {
cin >> n;
a[0] = 1; a[1] = 1;
for (int i = 2; i <= n; i++) {
a[i] = (4 * a[i - 1] - a[i - 2] + mod) % mod;
}
cout << a[n / 2 + 1];
return 0;
}