Вы не можете выбрать более 25 тем
Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.
164 строки
4.1 KiB
C++
164 строки
4.1 KiB
C++
#include <iostream>
|
|
#include <vector>
|
|
using namespace std;
|
|
|
|
int main()
|
|
{
|
|
const size_t SCREEN_WIDTH = 80;
|
|
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
|
unsigned int n;
|
|
size_t m;
|
|
int i;
|
|
char sim;
|
|
float lo,hi,dif, maxxs,minxs;
|
|
cerr<< "enter amount of numbers";
|
|
cin>>n;
|
|
vector <float> xs(n);
|
|
cerr<<"let's introduse array";
|
|
for(i=0; i < n; i++)
|
|
{
|
|
cin>> xs[i];
|
|
}
|
|
cerr << "enter amount of intervals";
|
|
cin >> m;
|
|
vector <size_t> b(m);
|
|
maxxs = minxs = xs[0];
|
|
for (i=0; i < n; i++)
|
|
{
|
|
if (xs[i] > maxxs) maxxs=xs[i];
|
|
if (xs[i] < minxs) minxs=xs[i];
|
|
}
|
|
dif=(maxxs - minxs)/m;
|
|
for(int i=0; i < n; i++)
|
|
{
|
|
bool found = false;
|
|
for (int j=0; (j < m-1)&&!found; j++)
|
|
{
|
|
lo= minxs + j*dif;
|
|
hi= minxs + (j+1)*dif;
|
|
if ((lo <= xs[i]) && (xs[i] <hi ))
|
|
{
|
|
b[j]++;
|
|
found = true;
|
|
}
|
|
}
|
|
if (!found)
|
|
{
|
|
b[m - 1]++;
|
|
}
|
|
}
|
|
size_t bmax,height,hem,hep;
|
|
int ibmax;
|
|
bmax=b[0];
|
|
for (i=0; i < m; i++)
|
|
{
|
|
if (b[i] > bmax) bmax=b[i];
|
|
ibmax = i;
|
|
}
|
|
//cout<<bmax<<endl;
|
|
if (bmax > MAX_ASTERISK)
|
|
{
|
|
for(int j=0; j < m; j++)
|
|
{
|
|
if (b[j]<100)
|
|
{
|
|
cout<<" ";
|
|
}
|
|
if (b[j]<10)
|
|
{
|
|
cout<<" ";
|
|
}
|
|
|
|
height = 76 * ( static_cast<double>(b[j]) / bmax);
|
|
hem = 76 * ( static_cast<double>(b[j-1]) / bmax);
|
|
hep = 76 * ( static_cast<double>(b[j+1]) / bmax);
|
|
cout<<b[j]<<'|';
|
|
|
|
if (j==0)
|
|
{
|
|
for (int u=0; u < height; u++)
|
|
{
|
|
if ((b[0] > b[1])&&(u == hep - 1)) cout<<'v';
|
|
else cout<<'*';
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (j == m)
|
|
{
|
|
|
|
for (int u = 0; u < height; u++)
|
|
{
|
|
if ((b[m] > b[m-1])&&(u == hem-1)) cout<<'^';
|
|
else cout<<'*';
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for (int u=0; u < height; u++)
|
|
{
|
|
sim='*';
|
|
if ((b[j] > b[j-1]) && (u == hem)) sim='^';
|
|
if ((b[j] > b[j+1])&&(u == hep)&&(u != height)&&(u != 0)) sim='V';
|
|
if ((b[j-1] == b[j+1])&&(u == hep)) sim='N';
|
|
cout<<sim;
|
|
}
|
|
|
|
}
|
|
}
|
|
cout<<endl;
|
|
}
|
|
}
|
|
for(int j=0; j < m; j++)
|
|
{
|
|
if (b[j]<100)
|
|
{
|
|
cout<<" ";
|
|
}
|
|
if (b[j]<10)
|
|
{
|
|
cout<<" ";
|
|
}
|
|
|
|
height = 76 * ( static_cast<double>(b[j]) / bmax);
|
|
hem = 76 * ( static_cast<double>(b[j-1]) / bmax);
|
|
hep = 76 * ( static_cast<double>(b[j+1]) / bmax);
|
|
cout<<b[j]<<'|';
|
|
|
|
if (j==0)
|
|
{
|
|
for (int u=0; u < b[i]; u++)
|
|
{
|
|
if ((b[0] > b[1])&&(u == b[i+1] - 1)) cout<<'v';
|
|
else cout<<'*';
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (j == m)
|
|
{
|
|
|
|
for (int u = 0; u < b[i]; u++)
|
|
{
|
|
if ((b[m] > b[m-1])&&(u == b[i-1]-1)) cout<<'^';
|
|
else cout<<'*';
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for (int u=0; u < b[i]; u++)
|
|
{
|
|
sim='*';
|
|
if ((b[j] > b[j-1]) && (u == b[i-1])) sim='^';
|
|
if ((b[j] > b[j+1])&&(u == b[i+1])&&(u != b[i])&&(u != 0)) sim='V';
|
|
if ((b[j-1] == b[j+1])&&(u == b[i+1])) sim='N';
|
|
cout<<sim;
|
|
}
|
|
|
|
}
|
|
}
|
|
cout<<endl;
|
|
}
|
|
return 0;
|
|
}
|