hdu 2164 Beat

来源：互联网发布：mac地址由什么组成编辑：程序博客网时间：2024/05/21 19:41

/* ***********************************************Author        :xryzEmail         :523689985@qq.comCreated Time  :4-9 22:30:18File Name     :Beat.cpp************************************************ */#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <time.h>using namespace std;int n,mp[20][20],vis[20],ans;void dfs(int now,int data,int cnt){    if(now==n) return;    ans=max(ans,cnt);    for(int i=0;i<n;i++)    {        if(vis[i]) continue;        if(mp[now][i]>=data)        {            vis[i]=1;            dfs(i,mp[now][i],cnt+1);            vis[i]=0;        }    }}int main(){    while(~scanf("%d",&n))    {        for(int i=0;i<n;i++)            for(int j=0;j<n;j++)                scanf("%d",&mp[i][j]);        ans=0;        memset(vis,0,sizeof(vis));        vis[0]=1;        dfs(0,0,1);        printf("%d\n",ans);    }    return 0;}

0 0