ZOJ 3471 Most Powerful 状压dp
来源:互联网 发布:马云在贵州大数据 编辑:程序博客网 时间:2024/05/18 17:59
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 <stdio.h>#include <string.h>#include <queue>#include <vector>#include <algorithm>using namespace std;const int maxn = 15;int dp[1 << maxn];int a[15][15];int main() { //freopen("in.txt", "r", stdin); int n; while (cin >> n && n) { for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) cin >> a[i][j]; } int all_bit = (1 << n) - 1;//bit位1表示没被撞,0表示已经被撞 memset(dp, 0, sizeof(dp)); for (int i = all_bit; i > 0; --i) { for (int j = 0; j < n; ++j) {//选出被撞的元素 if (i & (1 << j)) { for (int k = 0; k < n; ++k) {//枚举没被撞的进行dp if (i & (1 << k) && j != k) { dp[i ^ (1 << j)] = max(dp[i ^ (1 << j)], dp[i] + a[k + 1][j + 1]); } } } } } int res = 0; for (int i = all_bit; i > 0; --i) { res = max(dp[i], res); } cout << res << endl; }}
- 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)
- 博弈论基础 Nim博弈 取(m堆)石子游戏 HDU
- 12.1_数论总结
- 给程序员的一些建议
- 运用并查集与最小堆实现Kruskal算法
- MCMC和贝叶斯统计在宇宙微波背景辐射(CMB)中应用
- ZOJ 3471 Most Powerful 状压dp
- three.js中正交和透视投影相机的应用
- javascript关系运算符与逻辑运算符
- (算法分析Week13)Relative Ranks[Easy]
- Javascript中transducer的应用
- Spring官网jar包下载方法
- Logcat五种级别日志
- AI 技术与伦理
- PAT