#include <bits/stdc++.h>
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define int long long
#define ff first
#define ss second
#define pb push_back
#define y1 zildjian
#define left radio
#define right head
using namespace std;
const int N = 3e5+10;
const int INF = 1e18;
const int mod = 1e9+7;
const int mod1 = 998244353;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,m;
int h[N];
void solve(){
cin>>n>>m;
for(int i = 1;i<=n;i++){
cin>>h[i];
}
while(m--){
int t;
cin>>t;
if(t == 1){
int pos,val;
cin>>pos>>val;
h[pos] = val;
}
else{
int x;
cin>>x;
int ans = 0;
for(int i = 1;i<n;i++){
if(x>h[i] && x < h[i+1]) ans++;
if(x<h[i] && x>h[i+1]) ans++;
}
cout<<ans<<'\n';
}
}
}
signed main(){
// freopen("bootfall.in","r",stdin);
// freopen("bootfall.out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
// cout.tie(nullptr);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
// cout<<"Case "<<i<<": ";
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... |