Hoj 2665 Factory of XiaoE

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

using namespace std;

#define Maxk (1<<16)
#define Maxn 16
#define INF 0x3f3f3f3f

int dp[Maxk][Maxn];
int dist[Maxn][Maxn];

int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int n,m;
int sum;
int a,b;
while(scanf(" %d %d",&n,&m)!=EOF)
{
sum = 0;
for(int i=0;i<n;i++)
{
scanf(" %d %d",&a,&b);
sum += (b - a);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
scanf(" %d",&dist[i][j]);
}
}
memset(dp,0x3f,sizeof(dp));
m--;
dp[1<<m][m] = 0;

for(int i=0;i<(1<<n);i++)
{
//状态中含有起点
if(i & (1<<m))
{
for(int j=0;j<n;j++)
{
if(i & (1<<j) && j!=m && i!=(1<<j))
{
int temp = i - (1<<j);
for(int k=0;k<n;k++)
{
if(temp & (1<<k))
{
dp[i][j] = min(dp[i][j],dp[temp][k] + dist[k][j]);
}
}
}
}
}
}
int ans = INF;
for(int i=0;i<n;i++)
ans = min(ans,dp[(1<<n) - 1][i]);
printf("%d\n",sum - ans);

}
return 0;
}