include[HTML_REMOVED]
include[HTML_REMOVED]//STL set 动态维护有序序列
include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
const int N=1e5+10;
int a[N];
int main()
{
int n;
cin>>n;
set[HTML_REMOVED]> A;//同时存值和下标
A.insert({INT_MIN,0});//避免处理边界问题
A.insert({INT_MAX,0});
for(int i=1;i<=n;i++)
{
int a;
cin>>a;
if(i>1)
{
auto it=A.upper_bound({a,0});//返回大于a的最小值的定位
auto lt=it;
lt–;
long long left=(long long) lt->first-a;
long long right=(long long) it->first-a;
if(abs(left)<=abs(right))//可以先存一下
{
cout<[HTML_REMOVED]second<[HTML_REMOVED]second<<endl;
}
A.insert({a,i});
}
return 0;
}