ZOJ 3471 Most Powerful(状压DP）

最新推荐文章于 2019-03-20 17:48:39 发布

原创最新推荐文章于 2019-03-20 17:48:39 发布 · 895 阅读

0 ·

CC 4.0 BY-SA版权

状态压缩专栏收录该内容

9 篇文章

订阅专栏

本文深入探讨了深度学习在人工智能领域的应用，包括卷积神经网络、循环神经网络、强化学习等关键技术，以及它们在图像处理、自然语言处理、推荐系统等方面的实际应用案例。

链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3471

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: A₁, A₂, ... , A_N. 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 A_i and A_j collide with A_j 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状态下能够产生的最多的能量。

<span style="font-size:18px;">#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=1<<11;
int dp[1<<12];
int power[12][12];
int main()
{
    int n;
    while(scanf("%d",&n) && n)
    {
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++)
           for(int j=0;j<n;j++)
            scanf("%d",&power[i][j]);
        for(int s=(1<<n)-1;s>=0;s--)
        {
            for(int i=0;i<n;i++)
            {
                if(s & (1<<i))//找到第i个不为零的位置，和第j个为零的位置合并，且由上个状态转移过来
                {
                    for(int j=0;j<n;j++)
                    {
                         if(i==j) continue;
                         else if(s & (1<<j)) continue;
                         dp[s]=max(dp[s],dp[(s|(1<<j))]+power[i][j]);
                    }
                }
            }
        }
        int ans=-1;
        for(int i=0;i<=(1<<n)-1;i++)
        {
            ans=max(ans,dp[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}
</span>