#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, K, Q;
const int INF = 1e9;
struct Node{
int ans;
vector<int> L, R;
Node(){}
Node(int _ans){ans = _ans; L.resize(55, INF); R.resize(55, -INF);}
};
Node f(Node &p, Node &q){
Node ret(min(p.ans, q.ans));
for(int i = 1; i <= K; i++){
ret.L[i] = min(p.L[i], q.L[i]);
ret.R[i] = max(p.R[i], q.R[i]);
}
vector<pair<int, int>> V;
for(int i = 1; i <= K; i++){
V.push_back({p.R[i], i});
}
sort(V.begin(), V.end());
int r = -1;
for(int i = 0; i < (int)V.size() - 1; i++){
if(q.L[V[i].second] == -INF) break;
r = max(r, q.L[V[i].second]);
ret.ans = min(ret.ans, r - V[i + 1].first + 1);
}
return ret;
}
Node T[400005];
void update(int n, int s, int e, int k, int v){
if(s == e){
T[n] = Node(K == 1 ? 1 : INF);
T[n].L[v] = T[n].R[v] = k;
return;
}
int m = (s + e) / 2;
if(k <= m) update(n * 2, s, m, k, v);
else update(n * 2 + 1, m + 1, e, k, v);
T[n] = f(T[n * 2], T[n * 2 + 1]);
}
int main(){
cin.tie(0) -> sync_with_stdio(false);
fiint(T, T + 400005, Node(INF));
cin >> N >> K >> Q;
for(int i = 1; i <= N; i++){
int v; cin >> v;
update(1, 1, N, i, v);
}
while(Q--){
int op; cin >> op;
if(op == 1){
int k, v; cin >> k >> v;
update(1, 1, N, k, v);
} else {
cout << (T[1].ans > N ? -1 : T[1].ans) << '\n';
}
}
}
Compilation message
nekameleoni.cpp: In function 'int main()':
nekameleoni.cpp:48:5: error: 'fiint' was not declared in this scope
48 | fiint(T, T + 400005, Node(INF));
| ^~~~~
