题目大意:中文题不解释。
解题思路:并查集判断是否有环,没环则树形dp一下。
/* ***********************************************
┆ ┏┓ ┏┓ ┆
┆┏┛┻━━━┛┻┓ ┆
┆┃ ┃ ┆
┆┃ ━ ┃ ┆
┆┃ ┳┛ ┗┳ ┃ ┆
┆┃ ┃ ┆
┆┃ ┻ ┃ ┆
┆┗━┓ 马 ┏━┛ ┆
┆ ┃ 勒 ┃ ┆
┆ ┃ 戈 ┗━━━┓ ┆
┆ ┃ 壁 ┣┓┆
┆ ┃ 的草泥马 ┏┛┆
┆ ┗┓┓┏━┳┓┏┛ ┆
┆ ┃┫┫ ┃┫┫ ┆
┆ ┗┻┛ ┗┻┛ ┆
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
using namespace std;
#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")
#define maxn 1000001
struct Edge
{
int to,nx,w;
}edge[maxn*2];
int head[maxn],fa[maxn],dp[maxn],ans;
int cnt,n,m;
void addedge(int u,int v,int w)
{
edge[cnt] = Edge {v,head[u],w};
head[u] = cnt++;
edge[cnt] = Edge {u,head[v],w};
head[v] = cnt++;
}
int Find(int x)
{
if(x!=fa[x])
fa[x] = Find(fa[x]);
return fa[x];
}
void dfs(int u,int father)
{
int mx = 0;
for(int i=head[u];i;i=edge[i].nx)
{
int v = edge[i].to;
int w = edge[i].w;
if(v==father)continue;
dfs(v,u);
ans = max(ans,dp[v]+mx+w);
mx = max(mx,dp[v]+w);
}
dp[u] = mx;
}
void solve()
{
for(int i=1;i<=n;i++)
{
if(dp[i]==-1)
{
dfs(i,-1);
}
}
printf("%d\n",ans);
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);
while(~scanf("%d%d",&n,&m))
{
int flag = 0;
ans = 0,cnt = 1;
for(int i=1;i<=n;i++)
{
fa[i] = i;
dp[i] = -1;
head[i] = 0;
}
for(int i=1;i<=m;i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
addedge(u,v,w);
if(flag)continue;
int fx,fy;
fx = Find(u), fy = Find(v);
if(fx!=fy)
{
fa[fx] = fy;
}
else
flag = 1;
}
if(flag)
{
printf("YES\n");
continue;
}
solve();
}
return 0;
}