zoukankan      html  css  js  c++  java
  • ZOJ3471Most Powerful(状态压缩)

    问题

    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<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<iostream>
    using namespace std;
    const int inf=0x3f3f3f3f;
    int pho[12][12];
    int dp[1<<12];
    int main()
    {
        int n;
        scanf("%d",&n);
        while(n)
        {
            int ans=-inf;
            for(int i=1;i<=n;i++)
            {
                for(int j=1;j<=n;j++)
                {
                    scanf("%d",&pho[i][j]);
                }
            }
            for(int i=1;i<(1<<n);i++)
            {
                dp[i]=-inf;
            }
            int num;
            for(int s=0;s<(1<<n);s++)
            {
                num=0;
                for(int i=1;i<=n;i++)
                {
                    if(s&(1<<(i-1)))
                    {
                        if(s==(1<<(i-1)))
                        {
                            for(int j=1;j<=n;j++)
                            {
                                if(i==j)
                                    continue;
                                dp[s]=max(dp[s],pho[j][i]);
                            }
                        }
                        else
                        {
                            for(int j=1;j<=n;j++)
                            {
                                if((s&(1<<(j-1)))==0)
                                {
                                    dp[s]=max(dp[s],dp[s^(1<<(i-1))]+pho[j][i]);
                                }
                            }
                        }
                    }
                    else
                    {
                        num++;
                    }
                }
                if(num==1)
                {
                    ans=max(ans,dp[s]);
                }
            }
            printf("%d
    ",ans);
            scanf("%d",&n);
        }
    }
  • 相关阅读:
    maven-eclipse-plugin downloadSources downloadJavadocs
    maven的resources插件
    Intellij IDEA 添加项目依赖
    git 代码统计
    windows查看局域网ip
    Spring Boot学习笔记---Spring Boot 基础及使用idea搭建项目
    git push fatal: HttpRequestException encountered. An error occurred while sending the request
    ubuntu15中tomcat开机自动启动
    ubuntu15 设置静态ip && centos7设置静态ip
    ubuntu15.10 下时间同步
  • 原文地址:https://www.cnblogs.com/hua-dong/p/7966369.html
Copyright © 2011-2022 走看看