#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define vi vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define rep(i,a,n) for(ll i=a; i<n; i++)
#define per(i,a,n) for(ll i=n-1; i>=a; i--)
#define F first
#define S second
#define maxx(a,b) a=max(a,b)
#define minn(a,b) a=min(a,b)
#define db(x) cerr << #x << " = " << x << endl
#define N 1111111
using namespace std;
int a[N],b[N];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,m; cin>>n>>m;
rep(i,0,n)cin>>a[i];
rep(i,1,n)
{
int q=min(a[i-1],a[i]);
int w=max(a[i-1],a[i]);
b[q]++;
b[w+1]--;
}
rep(i,1,N)b[i]+=b[i-1];
while(m--)
{
int q,w,e;
cin>>q;
if(q==1)
{
cin>>w>>e;
cout<<1;
}
else
{
cin>>w;
cout<<b[w]<<endl;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
10856 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
10856 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
10856 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |