poj 3071 Football

题意：

有2^n支队伍进行比赛，每行给出这支队伍打败各支队伍的几率，求获胜几率最大的队伍

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cstring>
#include<stdlib.h>
#include<cmath>
using namespace std;
#define pb push_back
double p[140][140];
double dp[10][130];
int need(int x,int ps){
    if(x%(1<<(ps))>=1&&x%(1<<(ps))<=(1<<(ps-1)))
    return x/(1<<ps)*(1<<ps)+(1<<(ps-1))+1;
    if(x%(1<<(ps))==0)
    return (x/(1<<ps)-1)*(1<<ps)+1;
    return x/(1<<ps)*(1<<ps)+1;
}
int main(){
    int n;
    while(cin>>n&&n!=-1){
        for(int i=1;i<=(1<<n);i++)
            for(int j=1;j<=(1<<n);j++)
            scanf("%lf",&p[i][j]);
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=(1<<n);i++)
            dp[0][i]=1;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=(1<<n);j++){
                    int kk=need(j,i);
                    for(int k=kk;k<kk+(1<<(i-1));k++)
                        dp[i][j]+=dp[i-1][j]*dp[i-1][k]*p[j][k];
            }
        }
        int pos;
        double mm=0;
        for(int i=1;i<=(1<<n);i++)
        if(dp[n][i]>mm){
            mm=dp[n][i];
            pos=i;
        }
        cout<<pos<<endl;
    }
}