Need approach to solve this problem

help
1

can someone tell me what logic i can use to solve this problem?..

2

Detect Negative cycle in graph.
If found. Print YES
else NO
Use this for reference.

1 Like
3

You can use Floyd-Warshall to find distances between all the edges and then for each pair check if Dist(u, v) + Dist(v, u) < 0.
My solution link:
CodeChef: Practical coding for everyone

1 Like