Description
http://www.tsinsen.com/new/A1202
Solution
我们考虑一个DP:
设
d
p
[
i
]
[
0
/
1
]
dp[i][0/1]
dp[i][0/1]表示长度为
i
i
i的序列,开头和结尾相同/不相同的期望美观程度,那么显然有转移:
d
p
[
i
]
[
0
]
+
=
d
p
[
j
]
[
1
]
∗
(
i
−
j
)
∗
(
1
/
m
)
i
−
j
dp[i][0] += dp[j][1] * (i - j) * (1/m)^{i-j}
dp[i][0]+=dp[j][1]∗(i−j)∗(1/m)i−j
d
p
[
i
]
[
1
]
+
=
d
p
[
j
]
[
0
]
∗
(
i
−
j
)
∗
(
1
/
m
)
i
−
j
∗
(
m
−
1
)
dp[i][1] += dp[j][0] * (i - j) * (1/m)^{i-j} * (m - 1)
dp[i][1]+=dp[j][0]∗(i−j)∗(1/m)i−j∗(m−1)
d
p
[
i
]
[
1
]
+
=
d
p
[
j
]
[
1
]
∗
(
i
−
j
)
∗
(
1
/
m
)
i
−
j
∗
(
m
−
2
)
dp[i][1] += dp[j][1] * (i - j) * (1/m)^{i-j} * (m - 2)
dp[i][1]+=dp[j][1]∗(i−j)∗(1/m)i−j∗(m−2)
最后计算答案的时候,枚举开头的连续颜色的有多少个,结尾的语气颜色相同的有多少个即可。
Code
/**************************************
* Au: Hany01
* Prob: Tsinsen1202 彩色圆环
* Date: Sep 24th, 2018
* Email: hany01@foxmail.com
**************************************/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = j; i < i##_end_; ++ i)
#define For(i, j ,k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define PB(a) push_back(a)
#define MP(a, b) make_pair(a, b)
#define x first
#define y second
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define y1 wozenmezhemecaia
#ifdef hany01
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif
template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }
inline int read() {
register char c_; register int _, __;
for (_ = 0, __ = 1, c_ = getchar(); !isdigit(c_); c_ = getchar()) if (c_ == '-') __ = -1;
for ( ; isdigit(c_); c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
return _ * __;
}
const int maxn = 205;
int n, m;
LD pw[maxn], dp[maxn][2], ans;
int main()
{
#ifdef hany01
File("tsinsen1202");
#endif
n = read(), m = read(), pw[0] = 1;
For(i, 1, n) pw[i] = pw[i - 1] / m;
//0: same; 1: different
dp[0][0] = 1;
For(i, 1, n) For(j, 0, i - 1)
dp[i][0] += dp[j][1] * (i - j) * pw[i - j],
dp[i][1] += dp[j][0] * (i - j) * pw[i - j] * (m - 1),
dp[i][1] += dp[j][1] * (i - j) * pw[i - j] * (m - 2);
ans = n * pw[n - 1];
For(i, 1, n - 1) For(j, 0, n - i - 1)
ans += dp[n - i - j][1] * (i + j) * pw[i + j - 1];
printf("%.9lf\n", ans);
return 0;
}