uva167 The Sultan's Successors

最新推荐文章于 2022-02-13 22:03:21 发布

kgduu

最新推荐文章于 2022-02-13 22:03:21 发布

阅读量541

点赞数

分类专栏： OJ 文章标签： include

本文链接：https://blog.csdn.net/xiexingshishu/article/details/7193136

版权

OJ 专栏收录该内容

986 篇文章 1 订阅

订阅专栏

#include <stdio.h>
#include <string.h>

#define MAXN 8

int a[MAXN][MAXN], vis[3][2 * MAXN];
int num, ans;

void dfs(int cur);

int main()
{
int k, i, j, l;

    #ifndef ONLINE_JUDGE
        freopen("d:\\uva_in.txt", "r", stdin);
    #endif

scanf("%d", &k);

    for (i = 0; i < k; i++) {
        for (j = 0; j < MAXN; j++)
            for (l = 0; l < MAXN; l++)
                scanf("%d", &a[j][l]);

        memset(vis, 0, sizeof(vis));
        ans = 0;
        num = 0;

        dfs(0);
        printf("%5d\n", ans);
    }

return 0;
}

void dfs(int cur)
{
int i;

    if (cur == MAXN) {
        if (num > ans)
            ans = num;
    } else {
        for (i = 0; i < MAXN; i++) {
            if (!vis[0][i] && !vis[1][cur + i] && !vis[2][i - cur + MAXN]) {
                vis[0][i] = vis[1][cur + i] = vis[2][i - cur + MAXN] = 1;
                num += a[cur][i];
                dfs(cur + 1);
                num -= a[cur][i];
                vis[0][i] = vis[1][cur + i] = vis[2][i - cur + MAXN] = 0;
            }
        }
    }
}