洛谷 P2196 挖地雷

题目传送门

解题思路:

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

AC代码:

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

 using namespace std;

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

 inline void to(int x) {
     for(int i = ;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 = ;i <= n; i++) {
         if(g[x][i] && !vis[i]) {
             vis[i] = ;
             dfs(i,len + a[i],deep+);
             vis[i] = ;
         }
     }
 }

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

     return ;
 } 

//NOIP提高1996 T3