提交时间:2025-03-02 15:48:24

运行 ID: 37087

#include<bits/stdc++.h> #define int long long using namespace std; int id,n,m; int a[200005]; int ans[200005]; vector <int> s; signed main(){ cin>>id>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; int lst=2; for (int i=2;i<=n;i++){ if (a[i]>a[i+1]){ s.push_back(i-lst+1); lst=i+1; } } ans[0]=1; int sp=0; for (int sfsf=0;sfsf<s.size();sfsf++){ int x=s[sfsf]; ans[sp]--; ans[sp+1]+=x; if (ans[sp]==0) sp++; } cout<<sp+1<<endl; return 0; }