题解

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 8005;
ll n, q;
struct node{
	int v, idx;
}a[maxn];
int index_x[maxn];
bool cmp(node x, node y){
	if(x.v != y.v) return x.v < y.v;
	else return x.idx < y.idx;
}
int main(){
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
    	cin >> a[i].v;
    	a[i].idx = i;
	}
	sort(a + 1, a + n + 1, cmp);
	for(int i = 1; i <= n; i++){
		index_x[a[i].idx] = i;
	}
	while(q--){
		int op;
		cin >> op;
		if(op == 1){
			int x, v;
			cin >> x >> v;
			a[index_x[x]].v = v;
			int i = index_x[x];
			while(i >= 2 && (a[i].v < a[i - 1].v || a[i].v == a[i - 1].v && a[i].idx < a[i - 1].idx)){
				swap(index_x[a[i].idx], index_x[a[i - 1].idx]);
				swap(a[i], a[i - 1]);
				i--;
			}
			while(i < n && (a[i].v > a[i + 1].v || a[i].v == a[i + 1].v && a[i].idx > a[i + 1].idx)){
				swap(index_x[a[i].idx], index_x[a[i + 1].idx]);
				swap(a[i], a[i + 1]);
				i++;
			}
		}else{
			int x;
			cin >> x;
			cout << index_x[x] << endl;
		}
	}
    return 0;
}