codeforces 678E Another Sith Tournament

http://www.elijahqi.win/archives/1304
The rules of Sith Tournament are well known to everyone. n Sith take part in the Tournament. The Tournament starts with the random choice of two Sith who will fight in the first battle. As one of them loses, his place is taken by the next randomly chosen Sith who didn’t fight before. Does it need to be said that each battle in the Sith Tournament ends with a death of one of opponents? The Tournament ends when the only Sith remains alive.

Jedi Ivan accidentally appeared in the list of the participants in the Sith Tournament. However, his skills in the Light Side of the Force are so strong so he can influence the choice of participants either who start the Tournament or who take the loser’s place after each battle. Of course, he won’t miss his chance to take advantage of it. Help him to calculate the probability of his victory.
Input

The first line contains a single integer n (1 ≤ n ≤ 18) — the number of participants of the Sith Tournament.

Each of the next n lines contains n real numbers, which form a matrix pij (0 ≤ pij ≤ 1). Each its element pij is the probability that the i-th participant defeats the j-th in a duel.

The elements on the main diagonal pii are equal to zero. For all different i, j the equality pij + pji = 1 holds. All probabilities are given with no more than six decimal places.

Jedi Ivan is the number 1 in the list of the participants.
Output

Output a real number — the probability that Jedi Ivan will stay alive after the Tournament. Absolute or relative error of the answer must not exceed 10 - 6.
Examples
Input

3
0.0 0.5 0.8
0.5 0.0 0.4
0.2 0.6 0.0

Output

0.680000000000000

dp[s][j]表示在s状态下 并且擂主是j的最大比率是多少 边界条件 ：当只有擂主一个人并且擂主是自己的概率为1 然后开始dp 擂主是j有可能是顺延上来也有肯能是被其他人打下去 不过不妨碍 它在下一层是擂主 这个必须倒着做 要不然状态不齐

#include<cstdio>
#include<algorithm>
using namespace std;
double dp[1<<19][20],map[20][20];int n,bin[20];
/*void dfs(int s,int win){
    if (s==1&&win==0) {dp[1][0]=1;return;}dp[s][win]=0;
    for (int i=0;i<n;++i){
        if (s&bin[i]){
            for (int j=0;j<n;++j){
                if (i!=j){
                    if (dp[s-bin[i]][j]==-1) dfs(s-bin[i],j);if (dp[s-bin[j]][i]==-1) dfs(s-bin[j],i);
                    dp[s][win]=max(dp[s][win],dp[s-bin[i]][])
                }
            }
        }

    }
    if (ans<=1) return;
    if (!win){
        for (int i=0;i<n;++i)
            for (int j=i+1;j<n;++j){
                dp[s-bin[i]]=max(dp[s-bin[i]],dp[s]*map[j][i]*2.0/(ans*(ans-1)));
                dp[s-bin[j]]=max(dp[s-bin[j]],dp[s]*map[i][j]*2.0/(ans*(ans-1)));
                dfs(s-bin[j],i);dfs(s-bin[i],j);
            }
        return;
    }
    for(int i=0;i<n;++i){
        if (i==win) continue;
        if (bin[i]&s){
            dp[s-bin[i]]+=dp[s]*map[win][i]/(ans-1);
            dp[s-bin[win]]+=dp[s]*map[i][win]/(ans-1);dfs(s-bin[win],i);dfs(s-bin[i],win);
        }
    } 
}*/
int main(){
    freopen("cf.in","r",stdin);
    scanf("%d",&n);
    for (int i=0;i<n;++i)
        for (int j=0;j<n;++j) scanf("%lf",&map[i][j]);
    //dp[s][j] 表示当前这种状态j号是擂主的最大概率 
    for (int i=0;i<=n;++i) bin[i]=1<<i;dp[1][0]=1;
    for (int s=2;s<bin[n];++s){
        for (int i=0;i<n;++i){
            if (s&bin[i]){
                for (int j=0;j<n;++j){
                    if (j==i||!(s&bin[j])) continue;
                    dp[s][i]=max(dp[s][i],map[i][j]*dp[s-bin[j]][i]+map[j][i]*dp[s-bin[i]][j]);
                }
            }
        }
    }double ans1=0;
    for (int i=0;i<n;++i) ans1=max(ans1,dp[bin[n]-1][i]);
    printf("%f",ans1);
    return 0;
}

递归的思路和递推差不多 但是数组都需要二维才可以 否则状态不够记

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
double dp[1<<19][20],map[20][20];int n,bin[20];
void dfs(int s,int win){
    if (s==1&&win==0) {dp[1][0]=1;return;}dp[s][win]=0;
    for (int i=0;i<n;++i){
        if (i==win) continue;
        if ((s&bin[i])&&(s&bin[win])){
            if (dp[s-bin[i]][win]>1) dfs(s-bin[i],win);
            if (dp[s-bin[win]][i]>1) dfs(s-bin[win],i);
            dp[s][win]=max(dp[s][win],dp[s-bin[i]][win]*map[win][i]+dp[s-bin[win]][i]*map[i][win]);
        }
    }
}
int main(){
    freopen("cf.in","r",stdin);
    scanf("%d",&n);
    for (int i=0;i<n;++i)
        for (int j=0;j<n;++j) scanf("%lf",&map[i][j]);
    //dp[s][j] 表示当前这种状态j号是擂主的最大概率 
    for (int i=0;i<=n;++i) bin[i]=1<<i;
    double ans1=0;memset(dp,0x7f,sizeof(dp));
    for (int i=0;i<n;++i) {
        dfs(bin[n]-1,i);ans1=max(ans1,dp[bin[n]-1][i]);
    }
    printf("%f",ans1);
    return 0;
}