Most Powerful - ZOJ 3471 状压dp
来源:互联网 发布:淘宝网居家用品 编辑:程序博客网 时间:2024/05/02 10:27
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
题意:两个原子弹碰到一起后会产生一定的能量,并且其中一个会消失,问你最多产生多少能量。
思路:状压dp,dp[S]表示在S状态下能够产生的最多的能量。
AC代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int dp[4000],num[15][15];int main(){ int n,i,j,k,S,S2,ans; while(~scanf("%d",&n)&& n>0) { for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&num[i][j]); memset(dp,0,sizeof(dp)); S2=1<<n; for(S=0;S<S2;S++) for(i=0;i<n;i++) { if(S&(1<<i)) continue; for(j=0;j<n;j++) { if(i==j || (S&(1<<j))) continue; dp[S+(1<<j)]=max(dp[S+(1<<j)],dp[S]+num[i][j]); } } ans=0; for(i=0;i<n;i++) ans=max(ans,dp[S2-1-(1<<i)]); printf("%d\n",ans); }}
- Most Powerful - ZOJ 3471 状压dp
- ZOJ 3471 Most Powerful(状压DP)
- ZOJ 3471 Most Powerful(状压dp)
- ZOJ 3471 Most Powerful(状压DP)
- [ZOJ 3471] Most Powerful · 状压DP
- zoj 3471 Most Powerful 【状压DP】
- ZOJ 3471 Most Powerful(状压DP)
- ZOJ 3471 Most Powerful (状压DP)
- ZOJ 3471 Most Powerful (状压dp)
- ZOJ 3471 Most Powerful 状压dp
- zoj 3471 Most Powerful(状压)
- Most Powerful (zoj 3471 状压dp 点集配对)
- zoj 3471 Most Powerful 状压dp(简单)
- zoj 3471 Most Powerful //状态压缩DP
- ZOJ 3471 Most Powerful 状态压缩DP
- zoj 3471 Most Powerful 状态压缩dp
- zoj 3471 Most Powerful (状态压缩dp)
- ZOJ 3471 Most Powerful(状态压缩DP)
- request.getServerName()
- dinic方法求最大流
- 使用最好的驱鸟剂摆脱鸟
- 使用文章营销成功在线
- 清除缓存类
- Most Powerful - ZOJ 3471 状压dp
- 你最期待的舞会发型20092010
- adb 安桌调试桥的常用命令
- 连续子数组的最大和
- 体验迪斯尼魔术
- 未知错误——1
- 伟大的在线产品推广策略
- 优秀的工具为iPad游戏开发者
- 开始EEPlat之旅