状态压缩dp

1、POJ 2686 Traveling by Stagecoach

参考：《挑战程序设计竞赛》P195

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cctype>
#include <ctime>
#include <cassert>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define eps 1e-9

typedef long long ll;
typedef pair<int, int> pii;

const int INF = 0x3f3f3f3f;
const int maxn = 1 << 8;
int n, m, p, a, b, x, y, z;
double dp[maxn][40];
int t[10], G[40][40];

int main() {
#ifdef __AiR_H
    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
#endif // __AiR_H
    while (scanf("%d %d %d %d %d", &n, &m, &p, &a, &b)) {
        if (n + m + p + a + b == 0) { break; }
        REP(i, n) { scanf("%d", &t[i]); }
        memset(G, -1, sizeof(G));
        while (p--) {
            scanf("%d %d %d", &x, &y, &z);
            G[x][y] = z; G[y][x] = z;
        }
        REP(i, 1 << n) for (int j = 1; j <= m; ++j) { dp[i][j] = INF; }
        dp[(1 << n) - 1][a] = 0.0;
        double ans = INF;
        for (int s = (1 << n) - 1; s >= 0; --s) {
            for (int u = 1; u <= m; ++u) {
                for (int i = 0; i < n; ++i) {
                    if (s >> i & 1) {
                        for (int v = 1; v <= m; ++v) {
                            if (G[u][v] >= 0) {
                                dp[s & ~(1 << i)][v] = min(dp[s & ~(1 << i)][v], dp[s][u] + (double)G[u][v] / t[i]);
                            }
                        }
                    }
                }
            }
            ans = min(ans, dp[s][b]);
        }
        if (fabs(ans - INF) < eps) { printf("Impossible\n"); }
        else { printf("%.3f\n", ans); }
    }
#ifdef __AiR_H
    printf("Time used = %.2fs\n", (double)clock() / CLOCKS_PER_SEC);
#endif // __AiR_H
    return 0;
}