Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- using System.Collections.Generic;
- class RemainingSortedArray
- {
- static bool isSorted(List<int> list)
- {
- bool isSorted = true;
- for (int i = 0; i < list.Count - 1; i++)
- {
- if (list[i] > list[i + 1])
- {
- isSorted = false;
- }
- }
- return isSorted;
- }
- static void PrintList(List<int> list)
- {
- for (int i = 0; i < list.Count; i++)
- {
- Console.Write(list[i] + " ");
- }
- Console.WriteLine();
- }
- static void Main()
- {
- List<int> arrayOfNumbers = new List<int>() { 6, 1, 4, 3, 0, 3, 6, 4, 5 };
- List<int> result = new List<int>();
- int maxi = (int)Math.Pow(2, arrayOfNumbers.Count) - 1;
- int maxElements = 0;
- for (int i = 1; i <= maxi; i++)
- {
- List<int> temporaryList = new List<int>();
- int counter = 0;
- for (int j = 1; j <= arrayOfNumbers.Count; j++)
- {
- if (((i >> (j - 1)) & 1) == 1)
- {
- temporaryList.Add(arrayOfNumbers[j - 1]);
- counter++;
- }
- }
- if (counter > maxElements && isSorted(temporaryList))
- {
- result = temporaryList;
- maxElements = counter;
- }
- counter = 0;
- }
- PrintList(result);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement