Luogu P1294 master go for a walk

Luogu P1294 master go for a walk

Because of the small data, Adjacent Matrix memory to FIG.
No. 1 point to \ (t \) dots are set to the starting point, deep traversal search route, open a \ (vis \) array, which records every point is been visited. Every time the largest Directions from the current starting point is obtained, updated every answer.

#include<bits/stdc++.h>
#define N 30

using namespace std;

int t,n,ans,sum;
int e[N][N],vis[N];

void DFS(int k,int dis) {
    sum=max(sum,dis);
    for(int i=1;i<=t;i++) {
        if(e[k][i]>9&&vis[i]==0) {
            vis[i]=1;
            DFS(i,dis+e[k][i]);
            vis[i]=0;
        }
    }
    return;
}

int main()
{
    scanf("%d%d",&t,&n);
    for(int i=1;i<=n;i++) {
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        e[u][v]=w;
        e[v][u]=w;
    }
    for(int i=1;i<=t;i++) {
        vis[i]=1;
        DFS(i,0);
        ans=max(ans,sum);
        memset(vis,0,sizeof(vis));
    }
    printf("%d",ans);
    return 0;
}