The longest ascending sequence #47

Author: erickcernarequejo

Arrays/1D Arrays/longestAscendingSequence.java

@@ -9,18 +9,23 @@
 public class longestAscendingSequence {
 
     public static void main(String[] args) {
+        
+        //Read elements and size
         Scanner scanner = new Scanner(System.in);
         int tam = scanner.nextInt();
         int[] numbers = new int[tam];
 
         for (int i = 0; i < numbers.length; i++) {
             numbers[i] = scanner.nextInt();
         }
+        
+        //Defining auxiliary variables
 
         int maxTmp = 0;
         int count = 1;
         int pos = -1;
 
+        //Traverse the array and increment the amount by 1 the longest amount in the array, in addition to obtaining the position
         for (int i = 0; i < numbers.length - 1; i++) {
             if (numbers[i] < numbers[i + 1]) {
                 ++count;
@@ -33,13 +38,16 @@ public static void main(String[] args) {
             }
         }
 
+        //Check if count or maxTemp is the highest to assign the position from which the numbers will start printing
         if (maxTmp > count) {
             pos = (pos - maxTmp);
         }
 
+        //Get max value
         int max = Math.max(count, maxTmp);
         System.out.println("The max value is : " + max);
 
+        //Print elements
         for (int i = pos + 1; i <= pos + max; i++) {
             System.out.print(numbers[i] + " ");
         }
@@ -72,4 +80,4 @@ public static void main(String[] args) {
 
     }
 
-}
+}