void 数组的稳定性()
{//缘由https://bbs.csdn.net/topics/396522846 数组的不稳定性指标为:max-min
int aa[47]{}, n = 0, j = 0, c = 0, cc = 0;
cin >> n; while (j < n)cin >> aa[j++];
j = 0; while (++j < n) if (aa[j - 1] > aa[j])if ((cc = aa[j - 1] - aa[j]) > c) aa[n] = c, c = cc; else;
else if ((cc = aa[j] - aa[j - 1]) > c) aa[n] = c, c = cc; else;
cout << aa[n];//之上求最后最大差,之下求最后最小差。
c = j = 0; while (++j < n) if (aa[j - 1] > aa[j])if ((cc = aa[j - 1] - aa[j]) > c) aa[n] = aa[j - 1], c = cc; else;
else if ((cc = aa[j] - aa[j - 1]) > c) aa[n] = aa[j], c = cc; else;
c = aa[n]; j = 0; while (++j < n)if (aa[j - 1] != aa[n] && aa[j] != aa[n] && aa[j] != aa[j - 1])
if (aa[j - 1] > aa[j])if ((cc = aa[j - 1] - aa[j]) < c) c = cc; else;
else if ((cc = aa[j] - aa[j - 1]) < c) c = cc; else; else;
cout << ends << aa[n] << ends << c;
}
![](https://i-blog.csdnimg.cn/blog_migrate/ee1c425616f3e7dd9efa58684a031de7.png)
![](https://i-blog.csdnimg.cn/blog_migrate/4a1bfb2763ab9dfbdcdb8f4484bdee41.png)
void 数组的稳定性()
{//缘由https://bbs.csdn.net/topics/396522846 数组的不稳定性指标为:max-min
int aa[47]{}, n = 0, j = 0, c = 0, cc = INT_MAX;
cin >> n; while (j < n)cin >> aa[j++], (aa[j - 1]>aa[n] ? aa[n] = aa[j - 1] : 0), (aa[j - 1] < cc ? cc = aa[j - 1] : 0);
aa[n] -= cc; j = 0; if (n == 2)aa[n] = 0;
while (++j<n)if (aa[j - 1]>aa[j])if ((c = aa[j - 1] - aa[j]) < aa[n] && c)aa[n] = c; else;
else if ((c = aa[j] - aa[j - 1]) < aa[n] && c)aa[n] = c; else;
cout << aa[n];//源于输出可取巧
}