using System using System Collections Generic namespace Lab2 class Suc

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
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;
}
}
}