题目大意:找出’L’和’B’组成的长N的串,满足连续的’L’的个数不超过M个的方案数。
考虑
d
p
[
i
]
[
j
]
(
1
≤
i
≤
n
,
0
≤
j
≤
m
)
dp[i][j](1 \le i \le n,0 \le j \le m)
dp[i][j](1≤i≤n,0≤j≤m)表示遍历到第i个位置时,连续有j个’L’的方案数。
转移为
d
p
[
i
]
[
0
]
=
∑
0
≤
j
≤
m
d
p
[
i
−
1
]
[
j
]
,
d
p
[
i
]
[
j
]
=
d
p
[
i
−
1
]
[
j
−
1
]
(
0
<
j
≤
m
)
dp[i][0] = \sum\limits_{0 \le j \le m} dp[i-1][j], dp[i][j] = dp[i-1][j-1](0 < j \le m)
dp[i][0]=0≤j≤m∑dp[i−1][j],dp[i][j]=dp[i−1][j−1](0<j≤m)暴力的话是
1
0
8
10^8
108不知道给不给过。
想了个优化,令 s u m [ i ] = ∑ 0 ≤ j ≤ m d p [ i ] [ j ] sum[i] = \sum\limits_{0 \le j \le m}dp[i][j] sum[i]=0≤j≤m∑dp[i][j],那么 d p [ i ] [ 0 ] = s u m [ i − 1 ] dp[i][0] = sum[i-1] dp[i][0]=sum[i−1],最后答案就是 s u m [ n ] sum[n] sum[n]
现在考虑对sum的维护,每次转移时 s u m [ i ] = s u m [ i − 1 ] − d p [ i − 1 ] [ m ] + d p [ i ] [ 0 ] sum[i] = sum[i-1]-dp[i-1][m]+dp[i][0] sum[i]=sum[i−1]−dp[i−1][m]+dp[i][0]
其实就是 s u m [ i ] = 2 ∗ s u m [ i − 1 ] − d p [ i − 1 ] [ m ] sum[i] = 2*sum[i-1]-dp[i-1][m] sum[i]=2∗sum[i−1]−dp[i−1][m],这样其实只要维护 d p [ i ] [ m ] dp[i][m] dp[i][m]就行了——双向队列,对首为 d p [ i ] [ m ] dp[i][m] dp[i][m],因为 d p [ i ] [ m ] = d p [ i − 1 ] [ m − 1 ] dp[i][m] = dp[i-1][m-1] dp[i][m]=dp[i−1][m−1],所以每次取出对首 d p [ i − 1 ] [ m ] dp[i-1][m] dp[i−1][m],新的对首又变成 d p [ i ] [ m ] dp[i][m] dp[i][m]
PS:此题要高精度……BigNum就不贴了
代码如下:
#include <iostream>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <climits>
#include <ctime>
#include <cstring>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <map>
#include <set>
#define LL long long
#define Pr pair<int,int>
#define fread(ch) freopen(ch,"r",stdin)
#define fwrite(ch) freopen(ch,"w",stdout)
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9+7;
const double eps = 1e-8;
const int maxn = 11234;
deque <BigNum> q;
int main()
{
//fread("");
//fwrite("");
int n,m;
BigNum now,ze;
now = 1;
ze = 1;
scanf("%d%d",&n,&m);
for(int i = 0; i < m; ++i) q.push_back(0);
q.push_back(ze);
for(int i = 0; i < n; ++i)
{
ze = now;
now = now*2-q.front();
q.pop_front();
q.push_back(ze);
}
now.print();
return 0;
}