HDU 1565（方格取数(1)）

Intelligence1028

于 2020-06-14 08:20:02 发布

阅读量205

点赞数

文章标签： HDU

原文链接：https://blog.csdn.net/libin56842/article/details/24333215?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159209116819725219935576%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=159209116819725219935576&biz_id=0&utm_medi

版权

#include <iostream>
#include <algorithm>
using namespace std;
const int L = 20000;

int n;
int mp[25][25]; //地图
int dp[L], temp[L];
int pre[L], now[L]; //上一行的所有状态，当前行的所有状态
int preNum, nowNum; //上一行的状态数，当前行的状态数
int ans[L]; //各状态选择的数之和

//深搜，搜索当前行的所有状态
//r:行数，c:列数，s:当前行选择状态，sum:当前行选择的数之和
void DFS(int r, int c, int s, int sum)
{
    if (c >= n) //当前行搜索完成
    {
        now[++nowNum] = s;
        ans[nowNum] = sum;
        return;
    }
    DFS(r, c + 2, s | (1 << c), sum + mp[r][c]); //选择当前格子
    DFS(r, c + 1, s, sum); //不选择当前格子
}

//动态规划
void DP()
{
    for (int row = 1; row <= n; row++)
    {
        nowNum = 0;
        DFS(row, 0, 0, 0); //搜索当前行的所有状态
        for (int i = 1; i <= nowNum; i++)
            dp[i] = 0;

        for (int i = 1; i <= nowNum; i++)
        {
            for (int j = 1; j <= preNum; j++)
            {
                if (now[i] & pre[j]) //按位与不为0，即存在相邻格
                    continue;
                dp[i] = max(dp[i], temp[j] + ans[i]);
            }
        }

        for (int i = 1; i <= nowNum; i++) //当前行存为上一行
        {
            temp[i] = dp[i];
            pre[i] = now[i];
        }
        preNum = nowNum;
    }
}

int main()
{
    while (cin >> n)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 0; j < n; j++)
                cin >> mp[i][j];
        }

        temp[1] = pre[1] = 0;
        preNum = 1;
        DP();

        int ans = 0;
        for (int i = 1; i <= preNum; i++)
        {
            ans = max(ans, temp[i]);
        }
        cout << ans << endl;
    }
    return 0;
}