给定一个递增序列，a1 <a2 <...<an 。定义这个序列的最大间隔为d=max{ai+1 - ai }(1≤i<n),现在要从a2 ,a3 ..an-1 中删除一个元素。问剩余序列的最大间隔最小是多少？

// ConsoleApplication5.cpp : 定义控制台应用程序的入口点。
//

include "stdafx.h"

include

include

include

include

include

using namespace std;

int main()
{
int n;
while (cin >> n)
{
vector vec;
for (int i = 0; i < n; i++)
{
int num;
cin >> num;
vec.push_back(num);
}
vector veCopy = vec;
vector maxdVec;
for (int i = 0; i < n; i++)
{
vec = veCopy;
vec.erase(vec.begin()+i);
int maxd = vec[1] - vec[0];
for (int j = 1; j < n-2; j++)
{
if (maxd < (vec[j + 1] - vec[j]))
{
maxd = vec[j + 1] - vec[j];
}

}
maxdVec.push_back(maxd);
}
int mind = *min(maxdVec.begin(), maxdVec.end());
cout << mind << endl;
}

return 0;
}