https://ac.nowcoder.com/acm/problem/15032
#include<bits/stdc++.h>
#define ll long long
#define ios ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,a,b) for(int i=a;i<=b;++i)
using namespace std;
int a[105], b[105];
void sovle()
{
int n;
cin >> n;
if(n < 30 ) {
cout << "no";
return;
}
rep(i,1,n)
cin >> a[i];
int cnt = 0;
rep(i,1,n){
b[i] = 1; // 重置
for(int j = 1; j < i; j++){
// if(a[j] <= a[i] && b[j]+1 > b[i]){
// b[i] = b[j] + 1;
// }
if(a[j]<=a[i]) b[i]=max(b[i],b[j]+1);
// 如果之前的数小于这个数,添加进来
}
cnt = max(b[i],cnt);//if(b[i] > cnt) cnt = b[i];
}
if(cnt>=30) cout << "yes";
else cout << "no";
//cout << cnt;
}
int main()
{
ios;
sovle();
return 0;
}