ZOJ3471---Most Powerful(状压dp)
来源:互联网 发布:大数据在零售业的应用 编辑:程序博客网 时间:2024/05/28 23:21
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[i] 表示存在着的原子的状态为i时,放出的最大的能量
倒过来枚举状态就行了,最后只剩下1个原子
/************************************************************************* > File Name: ZOJ3471.cpp > Author: ALex > Mail: zchao1995@gmail.com > Created Time: 2015年04月24日 星期五 16时40分03秒 ************************************************************************/#include <functional>#include <algorithm>#include <iostream>#include <fstream>#include <cstring>#include <cstdio>#include <cmath>#include <cstdlib>#include <queue>#include <stack>#include <map>#include <bitset>#include <set>#include <vector>using namespace std;const double pi = acos(-1.0);const int inf = 0x3f3f3f3f;const double eps = 1e-15;typedef long long LL;typedef pair <int, int> PLL;LL dp[1050];LL A[15][15];int main() { int n; while (cin >> n) { if (!n) { break; } memset(dp, 0, sizeof(dp)); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { cin >> A[i][j]; } } for (int i = (1 << n) - 1; i >= 1; --i) { for (int j = 0; j < n; ++j) { if (i & (1 << j)) { for (int k = 0; k < n; ++k) { if (j == k) { continue; } if (i & (1 << k)) { dp[i ^ (1 << k)] = max(dp[i ^ (1 << k)], dp[i] + A[j][k]); } } } } } LL ans = 0; for (int i = 0; i < n; ++i) { ans = max(ans, dp[1 << i]); } cout << ans << endl; } return 0;}
- ZOJ3471---Most Powerful(状压dp)
- zoj3471 Most Powerful 状压dp
- zoj3471 Most Powerful 状压dp
- ZOJ3471 Most Powerful,状态压缩DP
- zoj3471 Most Powerful(状态压缩dp)
- ZOJ3471-Most Powerful-状态压缩dp
- ZOJ3471 Most Powerful
- zoj3471 Most Powerful
- most powerful ZOJ3471
- ZOJ3471——Most Powerful(状态压缩DP)
- 状压dp Most Powerful
- ZOJ 4257--Most Powerful(状压dp)
- 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】
- How to verify the Playback/Recording on WCD9330 Codec using tinymix commands
- QTextCodec中的setCodecForTr等终于消失了 (Qt5)
- Android动画之:Frame动画
- Android的Activity屏幕切换动画-左右滑动深入与实战
- seven叶项目总结03
- ZOJ3471---Most Powerful(状压dp)
- WIN7,Visual Assist安装 for VS2010
- ubuntu安装firefox的flashplayer插件
- SecureCRT中文显示乱码的解决方法
- RHEL6.4上升级python从2.6.6到2.7.3
- 【2015-04-24】Google Hosts (持续更新)
- iOS开发系列--音频播放、录音、视频播放、拍照、视频录制
- 仿驾校一点通android
- node 复制文件