题意:给出一个0到k的序列,要求出有每相邻的两个数之间的差不差过1的子序列的概率。
思路:递推,dp[i][j]表示长度为i并且j结尾的子序列的个数。注意,如果用符合子序列个数除以从个数,数组要用double,用long long的话会爆掉。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAXN = 105;
double dp[MAXN][MAXN];
int k, n;
void init() {
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= k; i++)
dp[1][i] = 1;
for (int i = 2; i <= n; i++)
for (int j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] = dp[i - 1][j] + dp[i - 1][j + 1];
else if (j == k)
dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
else
dp[i][j] = dp[i - 1][j] + dp[i - 1][j + 1] + dp[i - 1][j - 1];
}
}
int main() {
while (scanf("%d%d", &k, &n) != EOF) {
init();
double ans = 0;
for (int i = 0; i <= k; i++)
ans += dp[n][i];
double tmp = pow(k + 1, (double)n);
double p = ans / tmp * 100;
printf("%.5lf\n", p);
}
return 0;
}