Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <deque>
- using namespace std;
- int main(){
- int n, x;
- cin>>n>>x;
- deque <int> a(n);
- for (int i=0; i<n; i++){
- cin>>a[i];
- }
- deque <int> prefix(n);
- for (int i=1; i<n; i++){
- prefix[i]=prefix[i-1];
- if (a[i-1]>=x){
- prefix[i]++;
- }
- }
- int m;
- cin>>m;
- int ans=0;
- for (int i=0; i<m; i++){
- int y;
- cin>>y;
- if (y==1){
- int k;
- cin>>k;
- int q=prefix.back();
- if (a.back()>=x){
- q++;
- }
- prefix.push_back(q);
- a.push_back(k);
- }
- if (y==2){
- if (a.front()>=x){
- ans--;
- }
- a.pop_front();
- prefix.pop_front();
- }
- if (y==3){
- int k;
- cin>>k;
- cout<<prefix[k]+ans<<"\n";
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement