这道题有两个方法,一个是链表一个是平衡树,这里先用平衡树也就是set做的,用set可以很容易的找到一个数的前驱和后继,因为题目里面说了对于当前元素,从下标比它小的里面找满足题意的答案,所以这道题相当于是动态的过程,按照输入顺序,一个数只从先于它输入的数里面找前驱或者后继,用的是迭代器++,–的方法,找到之后直接比较两个数对应的答案输出即可
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
const int maxn = 1e5 + 5;
struct node {
int val, index;
node() {}
node(int a, int b): val(a), index(b) {}
friend bool operator < (const node &a, const node &b) {
return a.val < b.val;
}
};
int main() {
int n;
cin >> n;
set<node> st;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
st.insert(node(x, i));
if (i > 1) {
set<node>::iterator it = st.find(node(x, i));
set<node>::iterator it2 = it; it2++;
set<node>::iterator it1 = it;
if (it2 == st.end()) {
it1--;
cout << abs((*it1).val - x) << " " << (*it1).index << endl;
} else if (it == st.begin()) {
cout << abs((*it2).val - x) << " " << (*it2).index << endl;
} else {
it1--;
int t1 = abs((*it1).val - x);
int t2 = abs((*it2).val - x);
if (t1 < t2) cout << t1 << " " << (*it1).index << endl;
else if (t2 < t1) cout << t2 << " " << (*it2).index << endl;
else {
cout << t1 << " ";
if ((*it1).val < (*it2).val) cout << (*it1).index << endl;
else cout << (*it2).index << endl;
}
}
}
}
return 0;
}