Master Tree

CodeChefOpen on judge ↗

Chef recently went to London, where he met Master Tree and learnt the concept of `Greatness` of a tree. The `Greatness` of a tree is defined as per the following function - long long int great (int N, int A[]) { long long int value = 0; for (int i = 1; i < N; i++) { for (int j = i + 1; j <= N; j++) { if (a[i] < a[j]) {value++;} else {value--;}` } } return value; } Here, $N$ is the number of node

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI