Codeforces 454B. Little Pony and Sort by Shift

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

One day, Twilight Sparkle is interested in how to sort a sequence of integers a₁, a₂, ..., a_n in non-decreasing order. Being a young unicorn, the only operation she can perform is a unit shift. That is, she can move the last element of the sequence to its beginning:

a₁, a₂, ..., a_n → a_n, a₁, a₂, ..., a_n - 1.

Help Twilight Sparkle to calculate: what is the minimum number of operations that she needs to sort the sequence?

Input

The first line contains an integer n (2 ≤ n ≤ 10⁵). The second line contains n integer numbers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁵).

Output

If it's impossible to sort the sequence output -1. Otherwise output the minimum number of operations Twilight Sparkle needs to sort it.

Sample test(s)

input

2
2 1

output

1

input

3
1 3 2

output

-1

input

2
1 2

output

0

题解

暴力判断。

首先看数列有几个坡（坡为非减的序列），若大于两个，则无解输出-1.若有两个，则判断a[n]和a[1]的大小关系。若只有一个，则输出0。

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
int n,a[100002],ct,w;
void init()
{
    scanf("%d",&n);
    int i;
    for(i=1;i<=n;i++)
       {scanf("%d",&a[i]);
        if(a[i]>=a[i-1]) ct++;
        else w=i-1;
       }
    //printf("%d\n",ct);
}
void work()
{
    if(ct==n) {printf("0\n");}
    else if(ct<n-1) {printf("-1\n");}
    else
       {if(a[n]<=a[1]) printf("%d\n",n-w);
        else printf("-1\n");
       }
}
int main()
{
    init(); work();
    return 0;
}