template int maxi(int n, T a[])
{
int k = 1;
for(int i=2; i <=n; i++)
{
if(a[i]>a[k])
{
k = i;
}
}
return k;
}
template int mini(int n, T a[])
{
int k = 1;
for(int i=2; i <=n; i++)
{
if(a[i] {
k = i;
}
}
return k;
}
double maxgap(int n, double a[])
{
double mina = a[mini(n, a)], maxa = a[maxi(n, a)];
int *count = new int[n+1];
double *low = new double[n+1];
double *high = new double[n+1];
京公网安备 11010802041100号