hdu3471之状态压缩dp
来源:互联网 发布:淘宝卖家借贷额度 编辑:程序博客网 时间:2024/05/23 01:14
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
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>#include <algorithm>#include <map>#include <cmath>#include <iomanip>#define INF 99999999typedef long long LL;using namespace std;const int MAX=(1<<10)+10;int n;int dp[MAX],poww[20][20];void DP(){memset(dp,0,sizeof dp);int bit=1<<n;for(int i=0;i<bit;++i){//状态i,1表示该原子已被撞没,0表示还存在 for(int j=0;j<n;++j){if(i&(1<<j))continue;for(int k=0;k<n;++k){//用k去撞击j if(j == k)continue;if(i&(1<<k))continue;dp[i|(1<<k)]=max(dp[i|(1<<k)],dp[i]+poww[j][k]);}}}int sum=0;for(int i=0;i<n;++i)sum=max(sum,dp[bit-1-(1<<i)]);//最后只剩下原子i printf("%d\n",sum);}int main(){while(~scanf("%d",&n),n){for(int i=0;i<n;++i){for(int j=0;j<n;++j)scanf("%d",&poww[i][j]);}DP();}return 0;}/*1010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 1000010000 10000 10000 10000 10000 10000 10000 10000 10000 10000*/
- hdu3471之状态压缩dp
- poj1185之状态压缩dp
- hdu1565之状态压缩dp
- hdu4539之状态压缩dp
- hdu3254之状态压缩dp
- hdu1074之状态压缩dp
- hdu4628之状态压缩dp
- hdu3311之状态压缩dp
- hdu4049之状态压缩dp
- hdu3091之状态压缩dp
- hdu3681之状态压缩dp
- hdu4284之状态压缩dp
- hdu2817之状态压缩dp
- ZOJ2563 之状态压缩dp
- hdu 3920之状态压缩dp
- 状态压缩DP 之 poj 2686
- hdu4336之状态压缩慨率DP
- 动态规划之状态压缩dp入门
- 蓝牙4.0芯片 nRF51822
- C++随机数生成中种子值设置的一点总结,解决随机数序列重复问题
- CSDN第一天
- WEB利用PDF实现打印和排版
- cgi的表单处理
- hdu3471之状态压缩dp
- Cocos2d console使用手册
- android json解析
- java.lang.OutOfMemoryError: Java heap space解决方法
- 阿里腾讯入互联网金融业 可同富有难共患难
- 关于c#类对象的继承和vistual小例子
- 一般函数指针和类的成员函数指针
- 从java线程到内存空间
- 如何避免长时间使用电脑对自身的损害