CodeForces 454B Little Pony and Sort by Shift
来源:互联网 发布:淘宝网女士雪地靴 编辑:程序博客网 时间:2024/06/06 02:59
D - Little Pony and Sort by Shift
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uAppoint description:
Description
One day, Twilight Sparkle is interested in how to sort a sequence of integers a1, a2, ..., an 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:
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 ≤ 105). The second line contains n integer numbers a1, a2, ..., an(1 ≤ ai ≤ 105).
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 Input
Input
22 1
Output
1
Input
31 3 2
Output
-1
Input
21 2
Output
0
一定是不小心犯迷糊了,明明很水的题,却被自己搞的那么复杂,还一直没过,我也是无语了。。
题意:给出一个序列,问最少经过几步可以使它变为一个非递减序列,每步只能把最后一个放到第一个。
思路:判断一下这个序列式由几个递增序列组成,如果是由大于两个递增序列组成,则不行,如果是1个,
直接输出0,如果是两个再比较一下最后一个和第一个。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){int n,i,j,k,l,a[110000];while(scanf("%d",&n)!=EOF){for(i=1;i<=n;i++)scanf("%d",&a[i]);int flag=0;for(i=2;i<=n;i++){if(a[i]<a[i-1]){flag++;k=i;} }if(flag==0)printf("0\n");else if(flag>1)printf("-1\n");else if(flag==1&&a[n]<=a[1]){printf("%d\n",n-k+1);}else printf("-1\n");}return 0; }
0 0
- Codeforces 454B. Little Pony and Sort by Shift
- Codeforces 454B Little Pony and Sort by Shift(水题)
- CodeForces 454B Little Pony and Sort by Shift
- B. Little Pony and Sort by Shift
- B - Little Pony and Sort by Shift
- CF 454 B. Little Pony and Sort by Shift
- CF 454B Little Pony and Sort by Shift
- Codeforces Round #259 (Div. 2) B. Little Pony and Sort by Shift
- Codeforces Round #259 (Div. 2)-B. Little Pony and Sort by Shift
- Codeforces #259 (Div. 2) B. Little Pony and Sort by Shift
- Codeforces Round #259 (Div. 2) B. Little Pony and Sort by Shift(模拟)
- Codeforces Div. 2 #259-B. Little Pony and Sort by Shift
- Codeforces Round #259 (Div. 2) B. Little Pony and Sort by Shift(序列)
- Codeforces Round #259 (Div. 2) B - Little Pony and Sort by Shift
- Codeforces Round #259 (Div. 2) B. Little Pony and Sort by Shift
- Codeforces Round #259 (Div. 2) B. Little Pony and Sort by Shift
- Little Pony and Sort by Shift
- CF 454B Little Pony and Sort by Shift KMP算法简单运用
- Java加密解密算法-DES加密解密
- 函数输出100全部素数(while 与 if 区别)
- HDU5724(组合游戏,博弈论)
- 【离散数学】单射、满射和双射的定义、区别
- Android静态安全检测 -> 代码混淆检测
- CodeForces 454B Little Pony and Sort by Shift
- Patrick and Shopping
- 面试题47:不加加减乘除做加法
- 简单的应用调用驱动
- 2016夏季练习——二叉树
- 设计模式之策略模式
- POJ1236 图的一个连通性问题
- OVER(PARTITION BY)函数用法
- Volley、XUtils、Fson框架