This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
const int mx=1e6+10;
typedef long long ll;
const int mod=1e9+7;
const int MXm=22;
#define F first
#define S second
const int inf=1e9+10;
int pref[mx];
int a[mx];int n;
int main(){
cin>>n;
vector<int>v;
for(int i=0;i<n;i++){
cin>>a[i];
v.push_back(a[i]);
}
sort(v.begin(),v.end());
int ans=1;
for(int i=0;i<n;i++){
pref[v[i]]++;
if(i){
pref[v[i]]+= pref[v[i-1]];
}
}
for(int i=0;i<n-1;i++){
if(a[i+1]<a[i]){
ans++;
}else if(a[i+1]==a[i]||a[i]+1==a[i+1]){
}else{
int ok=0;
for(int j=0;j<i;j++){
if(a[j]>a[i]&&a[j]<a[i+1]){
ok=1;
}
}
if(ok){ans++;}
}
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |