(随机算法 、 步数搜索) Network Saboteur (P2531)

如果直接进行搜索会比较耗时，这样就可以规定搜索的步数，当达到这样的步数后就进行判断。

另一种方法就是随机算法，就是用随机数来使各种情况都考虑到，然后找到最大的结果。

   #include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
#include<vector>
#include<cstdlib>
#include<queue>
#include<algorithm>

using namespace std;


int n,ans;
#define N 22

int map[N][N];

bool  vist[N];
int a[N],b[N];

void dfs(int j,int s,int total)
{
    //cout<<j<<' '<<s<<' '<<total<<endl;
    if (s==0)
    {
        int numa=0,numb=0;
        for (int i=1;i<=n;i++)
        {
            if (vist[i])
                a[numa++]=i;
            else
                b[numb++]=i;
        }

        int sum=0;
        for (int i=0;i<numa;i++)
        {
            for (int j=0;j<numb;j++)
            {
                sum+=map[a[i]][b[j]];
            }
        }
        ans=max(ans,sum);
        return ;
    }

    for (int i=j;i<=n;i++) if (!vist[i])
    {
        vist[i]=true;
        dfs(i+1,s-1,total);
        vist[i]=false;
    }
}

int main()
{
    freopen("c:\in.txt","r",stdin);
    int i,j,k;

    cin>>n;
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
        {
            cin>>map[i][j];
        }
    }

    memset(vist,false,sizeof(vist));

    ans=0;
    for (i=1;i<=n/2;i++)
    {
        dfs(1,i,i);
    }

    cout<<ans<<endl;
    return 0;
} 

搜索

#include<stdio.h>  
#include<stdlib.h>  
#include<string.h>  
//please declare parameters here.  
  
  
//please declare functions here.  
const int RandTime=200000;  
int input[20][20];  
int N;  
bool A[20];  
int main()  
{  
    freopen("input.txt","r",stdin);  
    //input your ...  
    while(scanf("%d",&N)!=EOF)  
    {  
        memset(A,false,sizeof(A));  
        for(int i=0;i<N;i++)  
        {  
            for(int j=0;j<N;j++)  
            {  
                scanf("%d",&input[i][j]);  
            }  
        }  
        int max=0;  
        int sum=0;  
        for(int i=0;i<RandTime;i++)  
        {  
            int r=rand()%N;  
            A[r]=!A[r];  
            for(int j=0;j<N;j++)  
            {  
                if(A[j]!=A[r])  
                    sum+=input[j][r];  
                else if(A[j]==A[r]&&j!=r)  
                    sum-=input[j][r];  
            }  
            if(sum>max)  
                max=sum;  
        }  
        printf("%d\n",max);  
  
    }  
    return 0;  
}  

Network Saboteur

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 7836		Accepted: 3521

Description

A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traffic between parts.
A disgruntled computer science student Vasya, after being expelled from the university, decided to have his revenge. He hacked into the university network and decided to reassign computers to maximize the traffic between two subnetworks.
Unfortunately, he found that calculating such worst subdivision is one of those problems he, being a student, failed to solve. So he asks you, a more successful CS student, to help him.
The traffic data are given in the form of matrix C, where Cij is the amount of data sent between ith and jth nodes (Cij = Cji, Cii = 0). The goal is to divide the network nodes into the two disjointed subsets A and B so as to maximize the sum ∑Cij (i∈A,j∈B).

Input

The first line of input contains a number of nodes N (2 <= N <= 20). The following N lines, containing N space-separated integers each, represent the traffic matrix C (0 <= Cij <= 10000).
Output file must contain a single integer -- the maximum traffic between the subnetworks.

Output

Output must contain a single integer -- the maximum traffic between the subnetworks.

Sample Input

3
0 50 30
50 0 40
30 40 0

Sample Output

90

Source