-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvectors.cpp
54 lines (47 loc) · 1.32 KB
/
vectors.cpp
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
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
/*
* Напишете програма, която намира максимална редица от последователни еднакви елементи в вектор.
Пример: {6, 5, 5, 6, 7, 7, 6, 6, 6, 5} = {6, 6, 6}.
*/
int main()
{
string length;
cout << "Enter vector length: " << endl;
cin >> length;
int arrLength = atoi( length.c_str() );
vector<int> arr;
string enterString;
for (int count = 0; count < arrLength; count++)
{
cout << "Enter value " << endl;
cin >> enterString;
arr.push_back(atoi( enterString.c_str() ));
}
int maxCount = 0;
int value = 0;
for (int count = 0; count < arrLength; count++)
{
int currentCount = 0;
for (int minCount = count; minCount < arrLength; minCount++)
{
if (arr[count] == arr[minCount])
{
currentCount++;
if (maxCount < currentCount)
{
maxCount = currentCount;
value = arr[count];
}
}
else
{
break;
}
}
}
cout << "Max length: " << maxCount << " value: " << value << endl;
return 0;
}