D. Minimal Height Tree

题目传送门

D. Minimal Height Tree

题目大意

已知一个BFS的遍历顺序，每个结点的子节点是按照升序从左到右排列的
求树的最少的层数

思路

将每个升序的子序列接到树的目前的根结点，并且该子序列的长度即为下次可以接的子树的个数

AC Code

#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<math.h>
using namespace std;
#define endl '\n'
#define INF 0x3f3f3f3f
// #define int long long
#define debug(a) cout<<#a<<"="<<a<<endl;
typedef long long ll;
const double PI=acos(-1.0);
const double e=exp(1.0);
const int M=1e9+7;
const int N=2e5+7;
inline int mymax(int x,int y){return x>y?x:y;}
inline int mymin(int x,int y){return x<y?x:y;}
int T, n, a[N];
int ans, now, cnt, sum;
void solve(){
	cin>>n;
    ans=sum=1;
    cnt=now=0;
    cin>>a[1];
    for(int i=2; i<=n; i++){
        cin>>a[i];
        if(a[i]>a[i-1]) now++;
        else{
            cnt++;
            if(cnt==sum){
                ans++;
                cnt=0;
                sum=now;
            }
        }
    }
    cout<<ans<<endl;		
	return ;
}

signed main(){
    int T;
    cin>>T;
    while(T--) solve();
    return 0;
}