using System;
using System.Collections.Generic;
namespace Lab2
{
class Succession
{
private int[] arr = { 3, 2, 1, 0, 9, 7, 5, 3, 2, 4, 9, 5, 3, 3, 1, 0, 1, 3, 4, 4, 5, 7, 7, 9, 0 };
private List<int> temp = new List<int>();
private List<int> succession = new List<int>();
private int i = 0, j = 1;
public void Solution()
{
int len = arr.Length;
while (j < len - 1)
{
if (arr[i] >= arr[j])
goto Link;
LessOrEqual();
if (arr[i] <= arr[j])
continue;
Link:
GreaterOrEqual();
}
}
private void LessOrEqual()
{
do
{
temp.Add(arr[i]);
if ((j == arr.Length - 1) && (arr[i] <= arr[j]))
{
temp.Add(arr[j]);
if (succession.Count <= temp.Count)
succession = temp;
return;
}
i++;
j++;
}
while (arr[i] <= arr[j]);
temp.Add(arr[i]);
if (succession.Count <= temp.Count)
{
succession.Clear();
foreach (int item in temp)
{
succession.Add(item);
}
}
temp.Clear();
}
private void GreaterOrEqual()
{
do
{
temp.Add(arr[i]);
if ((j == arr.Length - 1) && (arr[i] >= arr[j]))
{
temp.Add(arr[j]);
if (succession.Count <= temp.Count)
succession = temp;
return;
}
i++;
j++;
}
while (arr[i] >= arr[j]);
temp.Add(arr[i]);
if (succession.Count <= temp.Count)
{
succession.Clear();
foreach (int item in temp)
{
succession.Add(item);
}
}
temp.Clear();
}
public string PrintSuccession()
{
string print = "";
foreach (int item in succession)
print += item + " ";
return print;
}
}
}