This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(){
ll n, m; cin >> n >> m;
vector<ll> v(n);
for(ll i = 0; i < n; ++i){
cin >> v[i];
}
ll ans = 0;
while(m--){
ll pos; cin >> pos;
if(pos == 1){
ll a, b; cin >> a >> b;
v[a - 1] = b;
}
else{
ans = 0;
ll k; cin >> k;
for(ll i = 0; i < n - 1; ++i){
if((v[i] <= k && v[i + 1] >= k)||(v[i] >= k && v[i + 1] <= k)){
ans++;
}
}
cout << ans << "\n";
}
}
}
int main() {
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |