洛谷 P2196 挖地雷

题目传送门

解题思路:

记忆化搜索,题目比较坑的地方在于,这是个有向图,给的边是单向边!!!!!!!!

AC代码:

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int n,a[21],way[21],ans = -111,en[21],ww;
bool g[21][21],vis[21];

inline void to(int x) {
    for(int i = 1;i <= x; i++)
        en[i] = way[i];
}

inline void dfs(int x,int len,int deep) {
    way[deep] = x;
    if(len > ans) {
        ans = len;
        to(deep);
        ww = deep;
    }
    for(int i = 1;i <= n; i++) {
        if(g[x][i] && !vis[i]) {
            vis[i] = 1;
            dfs(i,len + a[i],deep+1);
            vis[i] = 0;
        }
    }
}

int main() {
    scanf("%d",&n);
    for(int i = 1;i <= n; i++)
        scanf("%d",&a[i]);
    for(int i = 1;i <= n; i++)
        for(int j = i + 1;j <= n; j++) {
            int u;
            scanf("%d",&u);
            if(u == 1) g[i][j] = 1;
        }
    for(int i = 1;i <= n; i++) {
        memset(vis,0,sizeof(vis));
        vis[i] = 1;
        dfs(i,a[i],1);    
    }
    for(int i = 1;i <= ww; i++)
        printf("%d ",en[i]);
    printf("
%d",ans);
    
    
    return 0;
} 

//NOIP提高1996 T3