#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int inf = 0x7fffffff;
const int maxn = 30;
int map[maxn][maxn];
int vis[maxn];
int N;
int dfs(int u,int sum,int pre)
{
int ans = sum;
for(int v = 1;v <= N ;v++)
{
if(map[u][v]>=pre&&!vis[v])
{
vis[v] = 1;
ans=max(ans,dfs(v,sum+1,map[u][v]));
vis[v] = 0;
}
}
return ans ;
}
int main()
{
//freopen("in.txt","r",stdin);
while(scanf("%d",&N)!=EOF)
{
for(int i = 1;i <= N;i++)
for(int j = 1;j <= N;j++)
scanf("%d",&map[i][j]);
memset(vis,0,sizeof(vis));
vis[1] = 1;
printf("%d\n",dfs(1,1,0));
}
return 0;
}
hdu2614Beat dfs水题
原文：http://blog.csdn.net/cq_pf/article/details/44596639
