小根堆:k[i] <= k[2*i] 且 k[i] <= k[2*i+1]
大根堆:k[i] >= k[2*i] 且 k[i] >= k[2*i+1]
#include<iostream>(小根堆判断)
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=1;i<=n;i++)
cin>>a[i];
int flag=1;
for(int i=1;i<=n/2;i++)
{
if(2*i+1<=n&&a[i]>a[2*i+1])
flag=0;
if(a[i]>a[2*i])
flag=0;
}
if(flag==0)cout<<"No";
else cout<<"Yes";
return 0;
}