Submission #1136361

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j;
  int n;
  cin>>n;
  vi a(n),ord(n);
  rep(i,n){
    cin>>a[i];
    ord[i]=a[i];
  }
  sort(all(ord));
  int now=0;
  rep(i,n){
    while(a[now%n]!=ord[i])now++;
    a[now%n]=-1;
  }
  int ans=now/n+1;
  if(now%n==0)ans--;
  cout<<ans<<endl;
}

Submission Info

Judge Result