题目描述:http://hihocoder.com/problemset/problem/1075
没想法,后来看了题解,对概率进行dp,结果wa了
看了这篇文章:http://www.cnblogs.com/gaoxiang36999/p/4451493.html
是对能够打开全部箱子的方法数进行dp,最后除以总的数量
#include <stdio.h>
#include <string.h>
#define MAX_N 300
int n, k, box[MAX_N+1], cir[MAX_N+1], CIR, vis[MAX_N+1];
double dp[MAX_N+1][MAX_N+1], c[MAX_N+1][MAX_N+1];
void initComb(){
int i, j;
for(i = 0; i <= MAX_N; i++){
c[i][0] = c[i][i] = 1.0;
for(j = 1; j < i; j++){
c[i][j] = c[i-1][j-1] + c[i-1][j];
}
}
}
int main(){
int T, i, j, m, l, cc, c1, c2;
double temp;
initComb();
scanf("%d", &T);
while(T--){
scanf("%d%d", &n, &k);
for(i = 1; i <= n; i++){
scanf("%d", &box[i]);
}
memset(vis, 0, sizeof(vis));
CIR = 0;
for(i = 1; i <= n; i++){
if(!vis[i]){
vis[i] = 1;
cc = 1;
j = box[i];
while(i != j){
vis[j] = 1;
cc++;
j = box[j];
}
cir[++CIR] = cc;
}
}
memset(dp, 0, sizeof(dp));
cc = cir[1];
for(i = 1; i <= cc; i++){
dp[1][i] = c[cc][i];
}
for(i = 2; i <= CIR; i++){
c1 = cc;
c2 = cir[i];
cc = c1 + c2;
for(j = i; j <= k && j <= cc; j++){
for(m = 1; m < j && m <= c2; m++){
if(j-m <= c1){
temp = 1.0;
dp[i][j] += c[c2][m]*dp[i-1][j-m];
}
}
}
}
printf("%.9lf\n", dp[CIR][k]/c[n][k]);
}
return 0;
}