提交时间:2025-03-02 15:43:38

运行 ID: 37086

#include<bits/stdc++.h> #define int long long #define pii pair<int,int> #define mkp make_pair using namespace std; void init(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); //freopen("restorer.in","r",stdin);freopen("restorer.out","w",stdout); //freopen("test.in","r",stdin);freopen("test.out","w",stdout); } int num[300010]; int dep[300010]; queue<int>fat; signed main(){ init(); int id,n,m; cin>>id>>n>>m; for(int i=1;i<=n;i++)cin>>num[i]; fat.push(1); dep[1]=0; int j=1; while(j<=n){ int f=fat.front(); fat.pop(); j++; dep[j]=dep[f]+1; fat.push(j); while(num[j]<num[j+1]&&j<=n){ dep[j+1]=dep[f]+1; fat.push(j+1); j++; } } cout<<dep[n]<<endl; return 0; }