Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <queue>#include <string>#include <vector>#include <set>using namespace std;const int inf=0x3f3f3f3f;const int maxn=100000+10;typedef long long ll;int a[maxn],b[maxn];int main(){int n;cin>>n;for(int i=0;i<n;i++){cin>>a[i];b[i]=a[i];}int p=0,q=n-1;sort(b,b+n);for(int i=0;i<n;i++){if(a[i]==b[i]) p++;else break;}for(int i=n-1;i>=0;i--){if(a[i]==b[i]) q--;else break;}cout<<q-p+1<<endl;