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;
int a[100005];
int main()
{
int n, m;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
while(m--){
int q;
cin>>q;
if(q==1){
int pos, val;
cin>>pos>>val;
a[pos]=val;
}else{
int h;
cin>>h;
int ans=0;
for(int i=1;i<n;i++){
if(min(a[i], a[i+1])<=h&&max(a[i], a[i+1])>=h) ans++;
if(i!=1&&a[i]==h) ans--;
}
cout<<ans<<endl;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |