ZOJ3471——Most Powerful(状态压缩DP)
来源:互联网 发布:还原软件哪个好 编辑:程序博客网 时间:2024/05/29 05:54
Most Powerful
Time Limit: 2 Seconds Memory Limit: 65536 KB
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[S]表示状态时能产生的最大能量。。。二进制0表示没碰,即该气球存在
转移:dp[S]=max(dp[S']+map[i][j])
代码:
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;int n,dp[1<<11],map[11][11];void read(){ freopen("zoj3471.in","r",stdin); freopen("zoj3471.out","w",stdout);}void work(){ while(scanf("%d",&n)&&n) { memset(map,0,sizeof(map)); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&map[i][j]); int tot=1<<n; memset(dp,0,sizeof(dp)); for(int s=0;s<tot;s++) for(int i=1;i<=n;i++) { if(s&(1<<(i-1)))continue; for(int j=1;j<=n;j++) { if(i==j || s&(1<<(j-1)))continue; int S=s+(1<<(j-1)); dp[S]=max(dp[S],dp[s]+map[i][j]); } } int ans=0; for(int i=0;i<tot;i++) ans=max(ans,dp[i]); printf("%d\n",ans); }}int main(){ read(); work(); return 0;}
;
- ZOJ3471——Most Powerful(状态压缩DP)
- ZOJ3471 Most Powerful,状态压缩DP
- zoj3471 Most Powerful(状态压缩dp)
- ZOJ3471-Most Powerful-状态压缩dp
- DP状态压缩:Most Powerful
- ZOJ3471---Most Powerful(状压dp)
- zoj3471 Most Powerful 状压dp
- zoj3471 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 Most Powerful (状态压缩DP)
- zoj3471 dp 状态压缩
- 状态压缩DP(ZOJ3471)
- linux 向内核注册总线例子
- 10 个学习iOS开发的最佳网站
- IOS 6 自动布局 入门-1
- gc的效果
- [OpenStack] VMWare产品介绍
- ZOJ3471——Most Powerful(状态压缩DP)
- Spring中Propagation类的事务属性详解
- Android Manifest之<provider>元素中文注释
- C++动态创建和构造派生类
- NJUST 1739 - Count The Carries
- PSP自制固件procfw编译 – 小问题汇总
- 【新手教程】如何向App Store提交应用
- 深入浅出理解索引结构
- scanf()、getchar()、gets()、cin之间的区别