Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears and a lot of power is produced. Researchers know the way every two atoms perform when collided and the power every two atoms can produce.
You are to write a program to make it most powerful, which means that the sum of power produced during all the collides is maximal.
Input
There are multiple cases. The first line of each case has an integer N (2 <= N <= 10), which means there are N atoms: A1, A2, ... , AN. Then N lines follow. There are N integers in each line. The j-th integer on the i-th line is the power produced when Ai and Aj collide with Aj gone. All integers are positive and not larger than 10000.
The last case is followed by a 0 in one line.
There will be no more than 500 cases including no more than 50 large cases that N is 10.
Output
Output the maximal power these N atoms can produce in a line for each case.
Sample Input
2
0 4
1 0
3
0 20 1
12 0 1
1 10 0
0
Sample Output
4
22
题意:N种气体,任2个气体A,B相碰,B消失,同时获得能量,气体不能自碰,问最多能得到多少能量
分析:状态压缩DP
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <queue>
#define mem(p,k) memset(p,k,sizeof(p));
#define rep(a,b,c) for(int a=b;a<c;a++)
#define pb push_back
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
const int maxn=10;
int n,m,ans;
int mapp[15][15],dp[100000];
int main()
{
while(~scanf("%d",&n) && n){
mem(dp,0);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)scanf("%d",mapp[i]+j);
}
ans=0;
for(int i=(1<<n)-1;i>=0;i--){
for(int j=0;j<n;j++){
if(i==(1<<j)){
ans=max(ans,dp[i]);break;
}
if(i & (1<<j)){
for(int k=0;k<n;k++){
if(j!=k){
dp[i^(1<<k)]=max(dp[i^(1<<k)],dp[i]+mapp[j][k]);
}
}
}
}
}
cout<<ans<<endl;
}
return 0;
}