题解 | 小猫排队

#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
const int N=2e5+10;
int a[N];


signed main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    int time=0;
    int cute;
    cin>>cute;
    int pos=n+1;
    int exit=0;
    while(true)
    {
        int new_pos=pos;
        for(int i=pos-1;i>exit;i--)
        {
            if(a[i]>cute)
            {
                new_pos=i;
                break;
            }
        }
        if(pos==new_pos)
        {
            time+=(pos-exit);
            break;
        }
        pos=new_pos;
        if(exit+1==pos)
        {
            time++;
            break;
        }
        exit++;
        time++;
    }
    cout<<time<<endl;
    return 0;
}