SecondLab

  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
using System;
namespace Labs
{
class SecondLab
{
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 string _temp = "";
private string _succession = "";
private int i = 0, j = 1;
public SecondLab()
{
Console.WriteLine("Your multitude is:\n");
ArrPrint();
Console.WriteLine("\n\n-----------------\n");
Solu();
Console.WriteLine("The longest succession is:\n\n" + _succession);
Console.ReadKey();
}
private void Solu()
{
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 += Convert.ToString(_arr[i]) + " ";
if ((j == _arr.Length - 1) && (_arr[i] <= _arr[j]))
{
_temp += Convert.ToString(_arr[j]);
if (_succession.Length <= _temp.Length)
_succession = _temp;
return;
}
i++;
j++;
}
while (_arr[i] <= _arr[j]);
_temp += Convert.ToString(_arr[i]);
if (_succession.Length <= _temp.Length)
_succession = _temp;
_temp = "";
}
private void GreaterOrEqual()
{
do
{
_temp += Convert.ToString(_arr[i]) + " ";
if ((j == _arr.Length - 1) && (_arr[i] >= _arr[j]))
{
_temp += Convert.ToString(_arr[j]);
if (_succession.Length <= _temp.Length)
_succession = _temp;
return;
}
i++;
j++;
}
while (_arr[i] >= _arr[j]);
_temp += Convert.ToString(_arr[i]);
if (_succession.Length <= _temp.Length)
_succession = _temp;
_temp = "";
}
private void ArrPrint()
{
foreach (int item in _arr)
Console.Write(item + " ");
}
}
}