Gym - 101853E Maximum Sum

Gym - 101853E Maximum Sum

传送门：Gym - 101853E

题意

给你一个n*n的矩阵，然后每次取一个之后，就他四周的都不能取了，让你取完的最大值

题解

队友先开的这道题，我想了想。。。觉得和poj3254很像，就是内道题是取方案数，这个题是最大值。但是状压殊途同归。
预处理所有可能，然后预处理第一行，然后后面暴力匹配。状压结束。

ac代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
#include <iomanip>
//#include <unordered_map>

#pragma comment(linker, "/STACK:102400000,102400000")
#define fir first
#define sec second
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define clr(x) memset(x,0,sizeof(x))
#define cld(x) memset(x,-1,sizeof(x))
#define clx(x) memset(x,63,sizeof(x))
#define cln(x) memset(x,-64,sizeof(x))
#define rush() int T;scanf("%d",&T);while(T--)
#define pi 3.1415926
#define VM 100047
#define EM 400047
#define rd(x) scanf("%d",&x);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const ll llf = 0x3f3f3f3f3f3f3f3f;
const int maxn = (int) 1e6 + 7;
const double eps = 1e-10;
const ll mod1 = (int) 1e9 + 7;
const ll mod2 = 998244353;
const ll has = 99959;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

int bin[100];
int n, num;
int mp[100][100], a[6000];
int dp[20][6000];

void init(int n) {
    bin[1] = 1;
    for (int i = 2; i <= n; i++) {
        bin[i] = bin[i - 1] << 1;
    }
}

void try1(int x, int s) {
    if (x > n) {
        num++;
        a[num] = s;
        return;
    }
    try1(x + 1, s);
    try1(x + 2, s + bin[x]);
}

int main() {
    std::ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    rush() {
        clr(bin);
        clr(a);
        scanf("%d", &n);
        init(n);
        num = 0;
        try1(1, 0);
        int x;
        clr(dp);
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                scanf("%d", &mp[i][j]);
            }
        }
        for (int i = 1; i <= num; i++) {
            int w = a[i];
            int ans = 0;
            int p = 0;
            while (w) {
                p++;
                if (w % 2) {
                    ans += mp[1][p];
                }
                w /= 2;
            }
            dp[1][i] = ans;
        }
        for (int i = 2; i <= n; i++) {
            for (int j = 1; j <= num; j++) {
                for (int k = 1; k <= num; k++) {
                    if (!(a[j] & a[k]) && (!((a[j]) & (a[k] >> 1))) && (!(a[j] & (a[k] << 1)))) {
                        int w = a[j];
                        int ans = 0;
                        int p = 0;
                        while (w) {
                            p++;
                            if (w % 2) {
                                ans += mp[i][p];
                            }
                            w /= 2;
                        }
                        dp[i][j] = max(dp[i][j], dp[i - 1][k] + ans);
                    }
                }
            }
        }

        int ans = 0;
        for (int i = 1; i <= num; i++) {
            ans = max(ans, dp[n][i]);
        }
        printf("%d\n", ans);
    }
    return 0;
}