ZOJ 3471 Most Powerful(状压DP)
来源:互联网 发布:淘宝金牌卖家靠谱吗 编辑:程序博客网 时间:2024/05/18 11:26
Description
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[i]代表二进制下第i的原子核是否还在(1)
#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<string>#include<iostream>#include<queue>#include<cmath>#include<map>#include<stack>#include<bitset>using namespace std;#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )#define CLEAR( a , x ) memset ( a , x , sizeof a )typedef long long LL;typedef pair<int,int>pil;const int INF = 0x3f3f3f3f;int dp[(1<<10)+100];int mp[15][15];int n;int main(){ while(~scanf("%d",&n)&&n) { REPF(i,1,n) REPF(j,1,n) scanf("%d",&mp[i][j]); CLEAR(dp,0);int ans=0; int status=(1<<n)-1; for(int i=status;i>=0;i--) { for(int j=1;j<=n;j++) { if((i&(1<<(j-1)))==0) continue; for(int k=1;k<=n;k++) { if(k==j||(i&(1<<(k-1)))==0) continue; int st=i^(1<<(k-1)); dp[st]=max(dp[st],dp[i]+mp[j][k]); if(dp[st]>ans) ans=dp[st]; } } } printf("%d\n",ans); } return 0;}/**/
- ZOJ 3471 Most Powerful(状压DP)
- ZOJ 3471 Most Powerful(状压dp)
- ZOJ 3471 Most Powerful(状压DP)
- ZOJ 3471 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
- ZOJ 4257--Most Powerful(状压dp)
- Most Powerful (zoj 3471 状压dp 点集配对)
- zoj 3471 Most Powerful 状压dp(简单)
- zoj 3471 Most Powerful(状压)
- ZOJ 3471Most Powerful(状态压缩DP)
- zoj 3471 Most Powerful(状态压缩DP)
- zoj 3471 Most Powerful (状态压缩dp~)
- zoj 3471 Most Powerful //状态压缩DP
- hdu2571 命运 简单dp
- Redis的强大高级应用
- spket插件设置ExtJS自动提示
- Implement a Shell by yourself -- MIT xv6 shell
- iOS 完全复制UIView
- ZOJ 3471 Most Powerful(状压DP)
- iOS AutoLayout
- 2015编程之美资格赛2题—区间dp
- UVA 11361 Investigating Div-Sum Property(数位DP)
- 剑指offer--数组中的逆序对
- Android开发环境搭建
- G - Good subsequence
- POJ2375 Cow Ski Area (添最少边构造强连通分量的某个与入度出度相关的结论)
- error while loading shared libraries: xxx.so.x"错误的原因和解决办法