zoj3471
来源:互联网 发布:淘宝小卖家死了大半 编辑:程序博客网 时间:2024/06/07 02:26
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个原子,a和b碰撞会产生w[a][b]的能量且b会消失(总感觉题目这里没说清楚,哪颗会消失),剩下的那颗能去撞别的也能被别的撞,问最后总的能量最多是多少。
思路:状压dp,用1表示其存在,0表示消失,只要从全部都存在枚举到全部都消失即可。dp[i^(1<<k)]=max(dp[i^(1<<k)],dp[i]+w[j][k]); 最后取剩某一颗的最大值
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int w[15][15];int dp[1<<15];int main(void){int n;while(scanf("%d",&n),n){for(int i=0;i<n;i++)for(int j=0;j<n;j++)scanf("%d",&w[i][j]);memset(dp,0,sizeof(dp));for(int i=(1<<n)-1;i>0;i--)for(int j=0;j<n;j++)if((1<<j)&i)for(int k=0;k<n;k++)if(k!=j&&((1<<k)&i))dp[i^(1<<k)]=max(dp[i^(1<<k)],dp[i]+w[j][k]);int ans=0;for(int i=0;i<n;i++)ans=max(ans,dp[1<<i]);printf("%d\n",ans);}return 0;}
- zoj3471
- ZOJ3471
- zoj3471
- zoj3471 dp 状态压缩
- ZOJ3471 MostPowerful 状压DP
- ZOJ3471 Most Powerful
- 状态压缩DP(ZOJ3471)
- zoj3471 一维状压dp
- ZOJ3471 状态压缩DP
- zoj3471 Most Powerful
- most powerful ZOJ3471
- zoj3471 状压dp入门
- ZOJ3471【状压DP】
- ZOJ3471---Most Powerful(状压dp)
- zoj3471 Most Powerful 状压dp
- zoj3471 Most Powerful 状压dp
- ZOJ3471 Most Powerful,状态压缩DP
- zoj3471&nefu1109游戏争霸赛【状态压缩】
- Oracle Impdp Failed on RAC with ORA-31640, ORA-19505, ORA-27037, Linux-x86_64 Error: 2: No such file
- Oracle计算时间差函数
- Unity3D自带MonoDevelop编辑器断点调试教程
- GCD code block
- 音频会议服务类型可用在印度
- zoj3471
- 南阳理工2 括号配对问题
- CNN样例—手写字母识别LeNet-5
- Levenshtein距离算法详解
- 音轨掌握产品 - 所有你要明白当入门音轨主
- android中ListView与ScrollView同时需要的处理
- 音响设备对于卡拉OK系统运行
- 隐藏你的IP地址与VPN
- POJ 2196 Computer(搜索-深度优先搜索)