zoj - 3502 Contest

题意：：&& 题解  ：：here~~~~~~~~

#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int M = (1 << 10);
#define esp 1e-8
string s[M+1];
double map[15][15];
double dp[M];
int pre[M];
int main(){
    int t,n;
    cin >> t;
    while(t--){
        cin >> n;
        for(int i = 0;i < n;i++){
            for(int j = 0;j < n;j++){
                cin >> map[i][j];
                map[i][j] /= 100;
            }
        }
        int cnt = 1 <<n;
        s[0] = "";
        dp[0] = 0;
        memset(pre,0,sizeof(pre));
        for(int i = 1;i < cnt ;i++){
            dp[i] = -1;
            for(int j = n-1;j >= 0;j--){
                if(!(i&(1<<j))) continue;
                double p = 0;
                for(int k = n-1;k >= 0;k--){
                    int temp = 1 << k;
                    if(!(i&temp)) continue;
                    p = max(p,map[k][j]);
                }
                p = p + dp[i-(1<<j)];
                if(dp[i] + esp < p || (dp[i] - esp < p && s[i-(1<<j)] < s[i])){
                        dp[i] = p;
                        s[i] = s[i-(1<<j)];
                        s[i] += ('A' + j);
                }
            }
        }
        printf("%.2lf\n",dp[cnt-1]);
        cout << s[cnt-1] << endl;
    }
}