zoukankan      html  css  js  c++  java
  • [ZOJ 3471] Most Powerful

    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: 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


    Author: GAO, Yuan Contest: ZOJ Monthly, February 2011

    简单状压DP、1A、见代码

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    using namespace std;
    #define INF 0x3f3f3f3f
    
    int n;
    int mpt[12][12];
    int dp[1<<12];          //dp[i]表示i状态(初始为0,爆炸后变为1)下的最大值
    
    void solve()
    {
        int i,j,k,MAX=1<<n;
        dp[0]=0;
        for(j=0;j<MAX;j++)
        {
            for(i=0;i<n;i++)
            {
                if(j&(1<<i)) continue;
                for(k=0;k<n;k++)
                {
                    if(i==k) continue;     //自身不能和自身反应
                    if(j&(1<<k)) continue;
                    dp[j|(1<<k)]=max(dp[j|(1<<k)],dp[j]+mpt[i][k]);
                }
            }
        }
        int ans=0;
        for(i=0;i<MAX;i++)
        {
            ans=max(ans,dp[i]);
        }
        cout<<ans<<endl;
    }
    int main ()
    {
        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",&mpt[i][j]);
                }
            }
            solve();
        }
        return 0;
    }
    趁着还有梦想、将AC进行到底~~~by 452181625
  • 相关阅读:
    模拟信号的优缺点分析
    PLC控制网关的功能介绍及应用领域
    LoRa无线数传终端的优势
    串口服务器厂家哪家好
    串口转以太网转换器的工作模式
    一个能手机控制水泵的无线远程开关控制器
    以太网IO模块是什么
    支持MQTT的模块有哪些
    常用正交表
    Spring Boot源码(五)以HttpEncodingAutoConfiguration【Http 编码自动配置】为例解释自动配置原理
  • 原文地址:https://www.cnblogs.com/hate13/p/4104754.html
Copyright © 2011-2022 走看看