计蒜客 18488.Extreme Sort (German Collegiate Programming Contest 2015 ACM-ICPC Asia Training League 暑假第一阶段第三场 E)

E.Extreme Sort

传送门

代码:

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<cmath>
 using namespace std;
 const int maxn=1e5+;
 int a[maxn];
 int main(){
     int n;
     scanf("%d",&n);
     for(int i=;i<n;i++)
         scanf("%d",&a[i]);
     for(int i=;i<n;i++){
         if(a[i]<a[i-]){
             cout<<"no"<<endl;
             return ;
         }
     }
     cout<<"yes"<<endl;
 }