comments for bob solutions

solutions/battle-of-the-brains-2026/MaximumAura.java

@@ -7,6 +7,7 @@ import java.io.PrintWriter;
 import java.util.PriorityQueue;
 import java.util.StringTokenizer;
 
+//Correct solution with too much time complexity O(n*n) fails almost every test case to time
 public class MaximumAura {
   public static void main(String[] args) throws IOException {
 
@@ -53,7 +54,6 @@ public class MaximumAura {
       out.print((left[i] + right[i] - 1) + " ");
     }
 
-
     br.close();
     out.flush();