#include <conio.h>
#include <iostream.h>
const n = 10;
int k, m, kmax, kindex;
void main()
{
int mas[n]={9,25,25,10,10, 10, 10, 5, 5, 5};
clrscr();
k=0;
m=mas[0];
kmax = 0;
kindex = 0;
for (int i=0; i<n; i++)
{
if (mas[i]==m)
{
k++;
}
else
{
if (k > kmax)
{
kmax = k;
kindex = i-kmax;
}
k = 0;
m = mas[i];
i--;
}
}
cout<<"\n posledovatelnost odinakovix chisel "<<kmax<<"\n\n";
for (i = kindex; i < kindex+kmax; i++)
cout << mas[i]<<" ";
getch();
}
Полный квадрат |