codeforces 451B Sort the Array
来源:互联网 发布:mac itunes 添加铃声 编辑:程序博客网 时间:2024/06/05 18:56
点击打开链接
Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array a consisting of n distinct integers.
Unfortunately, the size of a is too small. You want a bigger array! Your friends agree to give you a bigger array, but only if you are able to answer the following question correctly: is it possible to sort the array a (in increasing order) by reversing exactly one segment of a? See definitions of segment and reversing in the notes.
The first line of the input contains an integer n (1 ≤ n ≤ 105) — the size of array a.
The second line contains n distinct space-separated integers: a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ 109).
Print "yes" or "no" (without quotes), depending on the answer.
If your answer is "yes", then also print two space-separated integers denoting start and end (start must not be greater than end) indices of the segment to be reversed. If there are multiple ways of selecting these indices, print any of them.
33 2 1
yes1 3
42 1 3 4
yes1 2
43 1 2 4
no
21 2
yes1 1
Sample 1. You can reverse the entire array to get [1, 2, 3], which is sorted.
Sample 3. No segment can be reversed such that the array will be sorted.
Definitions
A segment [l, r] of array a is the sequence a[l], a[l + 1], ..., a[r].
If you have an array a of size n and you reverse its segment [l, r], the array will become:
a[1], a[2], ..., a[l - 2], a[l - 1], a[r], a[r - 1], ..., a[l + 1], a[l], a[r + 1], a[r + 2], ..., a[n - 1], a[n].
题意:逆转数组的一段,看能不能使它从小到大,如果能,输出这一段的始末位置,如果本身就是从小到大的,输出1 1。注意格式。
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<vector>const int ma=1e5+10;typedef long long ll;using namespace std;int a[ma],b[ma];int main(){ int n; cin>>n; for(int i=1; i<=n; i++) { cin>>a[i]; b[i]=a[i]; } sort(b+1,b+n+1); int s=0,st=-1,en=-1; for(int i=1; i<=n; i++) { if(a[i]!=b[i]) { s++; if(st==-1) st=i; else en=i; } } if(s==0) { cout<<"yes"<<endl; cout<<"1 1"<<endl; return 0; } s=en-st+1; int w1=st,w2=en; for(int i=1; i<=s/2; i++) { int temp=a[st]; a[st]=a[en]; a[en]=temp; //cout<<st<<' '<<en<<endl; st++; en--; } for(int i=1; i<=n; i++) { if(a[i]!=b[i]) { cout<<"no"<<endl; return 0; } } cout<<"yes"<<endl<<w1<<" "<<w2<<endl; /*for(int i=1;i<=n;i++) cout<<a[i]<<' '; cout<<endl; for(int i=1;i<=n;i++) cout<<b[i]<<' '; cout<<endl;*/ return 0;}
- Codeforces 451B Sort the Array
- Codeforces 451B Sort the Array(水题)
- Codeforces 451 B. Sort the Array
- CodeForces 451B Sort the Array
- CodeForces 451B. Sort the Array
- codeforces 451B Sort the Array
- CodeForces 451B Sort the Array(排序,逆序)
- [Codeforces 451B] Sort the Array (实现)
- CodeForces - 451B Sort the Array 简单模拟
- 451 B. Sort the Array
- 451B - Sort the Array
- Sort the Array CodeForces
- B - Sort the Array
- B. Sort the Array
- Codeforces #258 (Div. 2) B. Sort the Array
- Codeforces Round #258 (Div. 2) 2B Sort the Array
- Codeforces Round #258 (Div. 2) B. Sort the Array
- Codeforces Div. 2 #258-B. Sort the Array
- 2017年湖南省第十三届大学生计算机程序设计竞赛Seating Arrangement
- 机器学习的基本问题
- 宝马CIC主机清FSC的方法步骤
- ABBYY FineReader 14下载 v14.0.101中文破解版
- pat 乙级 1055. 集体照 (25)
- codeforces 451B Sort the Array
- JavaWeb——EL及JSTL学习总结
- eclipse 找不到或无法加载主类
- C语言实现二叉树的各种遍历及求解深度
- c# enum用法 枚举用法 Asp.net ENUM用法
- 观察者模式
- SVN版本管理特细( truck、branches(分支)、tags(标记))
- LTE 时偏纠正 下行同步
- LintCode刷题阶段性总结---链表容易篇(翻转链表,删除链表重复元素,合并两个排序链表等)