poj -- 2288 Islands and Bridges

#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef __int64 LL;
#define M 1<<14
LL dp[M][14][14];
LL s[M][14][14];
LL v[14];
int map[14][14];
int n,m;
void DP()
{
int cnt = 1 << n;

for(int i = 0;i < cnt;i++)
{
for(int j = 0;j < n;j++)
{
for(int k = 0;k < n;k++)
{
if(dp[i][j][k] == -1) continue;
for(int r = 0;r < n;r++)
{
if(r == j || r == k || i&(1<<r) || !map[k][r]) continue;
LL xx = v[r] + v[r] * v[k] + dp[i][j][k];
if(map[j][r]) xx += v[j] * v[k] * v[r];
LL& Vmax = dp[i+(1<<r)][k][r];
if(Vmax  < xx){
Vmax = xx;
s[i+(1<<r)][k][r] = s[i][j][k];
}
else if(Vmax == xx)
s[i+(1<<r)][k][r] += s[i][j][k];
}
}
}
}
LL ans = 0;
LL num = 0;
for(int i = 0;i < n;i++)
{
for(int j = 0;j < n;j++)
{
if(dp[cnt-1][i][j] == -1) continue;
if(dp[cnt-1][i][j] > ans)
{
ans = dp[cnt-1][i][j];
num = s[cnt-1][i][j];
}
else if(dp[cnt-1][i][j] == ans)
num += s[cnt-1][i][j];
}
}
if(num) cout << ans << " " << num/2 << endl;
else cout << "0 0" << endl;
}
int main()
{
int t,u,w;
cin >> t;
while(t--)
{
cin >> n >> m;
for(int i = 0;i < n;i++)
cin >> v[i];
memset(map,0,sizeof(map));
memset(dp,-1,sizeof(dp));
memset(s,0,sizeof(s));
for(int i = 0;i < m;i++)
{
cin >> u >> w;
u -- ; w --;
map[u][w] = map[w][u] = 1;
int st = (1 << u) + (1 << w);
dp[st][u][w] = dp[st][w][u] = v[u] + v[w] + v[u] * v[w] ;
s[st][u][w] = s[st][w][u] = 1;
}
if(n == 1){
cout << v[0] << " 1" << endl;
continue;
}
DP();
}
}