Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,916 questions

51,849 answers

573 users

How to count the number of strictly increasing subarrays in an array with C#

1 Answer

0 votes
using System;

public class Program {
	public static int countStrictlyIncreasingSubarrays(int[] arr) {
		int size = arr.Length;
		int count = 0;

		for (int i = 0; i < size; i++) {
			for (int j = i + 1; j < size; j++) {
				if (arr[j - 1] >= arr[j]) {
					break;
				}
				count++;
				for (int k = i; k < j + 1; k++) { // for print only
					 Console.Write(arr[k] + " "); // for print only
				}                                 // for print only
				Console.WriteLine();              // for print only
			}
		}
		return count;
	}
	public static void Main(string[] args)
	{
		int[] arr = new int[] {1, 3, 4, 0, 7, 5, 9};
		// {1, 3}, {1, 3, 4}, {3, 4}, {0, 7}, {5, 9}

		Console.Write(countStrictlyIncreasingSubarrays(arr));
		Console.Write(" = Count of strictly increasing subarrays");

	}
}






/*
run:
 
1 3 
1 3 4 
3 4 
0 7 
5 9 
5 = Count of strictly increasing subarrays
 
*/

 



answered Aug 21, 2022 by avibootz
...