@Ev[G]eN
iOS/Android Developer
5114 / 1552 / 383
Регистрация: 23.01.2011
Сообщений: 3,175
|
16.01.2014, 13:54
|
|
тоже предложу
C++ | 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
| #include <iostream>
#include <cstdlib>
#include <ctime>
template <class Iterator>
size_t maximalPairLength(Iterator first, Iterator last);
int main()
{
std::srand((size_t)(std::time)(nullptr));
size_t arraySize;
std::cout << "N: ";
std::cin >> arraySize;
int *array = new int [arraySize];
std::cout << "Array: " << std::endl;
for (size_t i = 0; i < arraySize; i++) {
std::cout << (*(array + i) = std::rand() % 5) << " ";
}
std::cout << std::endl << "Maximal length of pair: " << maximalPairLength(array, array + arraySize) << std::endl;
delete [] array;
std::system("pause");
return 0;
}
template <class Iterator>
size_t maximalPairLength(Iterator first, Iterator last)
{
size_t result(0);
while (first != (last - 1)) {
result += *first == *(first + 1) ? 1 : 0;
first++;
}
return result;
} |
|
1
|