题意:
有2^n个队,相邻的两两打淘汰赛,,求最后哪个队夺冠的概率最大
思路:
这里只说怎么位运算判相邻:所有高位是一样的,第i位刚好相反
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
double dp[10][200], p[200][200];
int main() {
int n;
while(~scanf("%d", &n) && ~n) {
memset(dp, 0, sizeof(dp));
for (int i = 0; i < (1<<n); i++) {
for (int j = 0; j < (1<<n); j++) scanf("%lf", &p[i][j]);
}
for (int i = 0; i < (1<<n); i++) dp[0][i] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < (1<<n); j++) {
for (int k = 0; k < (1<<n); k++) {
if (((j>>(i-1))^1) == (k>>(i-1))) dp[i][j] += dp[i-1][j] * dp[i-1][k] * p[j][k];
}
}
}
double maxv = 0;
int ans = 0;
for (int i = 0; i < (1<<n); i++) {
if (dp[n][i] > maxv) { maxv = dp[n][i]; ans = i + 1; }
}
printf("%d\n", ans);
}
return 0;
}