CodeForces - 451B Sort the Array 简单模拟
来源:互联网 发布:拍网络电影多少钱 编辑:程序博客网 时间:2024/06/10 10:28
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].
先进行排序,然后进行模拟就好了
#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#include <fstream>#include <algorithm>#include <queue>#include <climits>#include <cstring>#include <string>#include <set>#include <map>#include <queue>#include <stack>#include <vector>#include <list>const int maxn=5e2+10;const int INF = 1e9;using namespace std;typedef long long ll;typedef unsigned long long ull; const int N = 1e6+5;typedef struct node{ll val;ll index;}NODE;NODE a[100005];NODE b[100005];int flag[100005];ll n; int cmp(NODE x,NODE y){return x.val<y.val;}int main(){ios::sync_with_stdio(false); cin >>n;for(int i=1;i<=n;i++){cin >> a[i].val;a[i].index = i;b[i] = a[i];}ll l=0,r=0,ct= 0 ;sort(a+1,a+1+n,cmp);for(int i=1;i<=n;i++){if(a[i].val!=b[i].val){flag[i]=1;ct ++; }}for(int i=1;i<=n;i++){if(flag[i]==1){l = i;break;}}if(l==0){cout << "yes"<<endl<<" 1 1 "<<endl;return 0; } for(int i=n;i>=l;i--){if(flag[i]==1){r = i;break;} }//cout <<r<<l<<endl; /*if(r-l+1!=ct){cout <<"no"<<endl;return 0;}*/for(int i=l,j=r;i<=j;i++,j--){if(a[i].val!=b[j].val){cout <<"no"<<endl;return 0;}}for(int i=l,j=r;i<=j;i++,j--){if(b[i].val!=a[j].val){cout <<"no"<<endl;return 0;}}cout << "yes"<<endl<<l<<" "<<r<<endl;return 0;}
- CodeForces - 451B Sort the Array 简单模拟
- 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 (实现)
- 451 B. Sort the Array
- 451B - Sort the Array
- Codeforces Round #258 (Div. 2) B. Sort the Array (模拟)
- Codeforces Round #258 (Div. 2) B. 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
- 折半查找法
- Kafka入门经典教程
- 是时候来一发DataBinding了
- 四道Java基础题 你能对几道?
- 数据链路层
- CodeForces - 451B Sort the Array 简单模拟
- pgfincore安装
- 把标准时间改成一般时间
- Kafka安装及部署
- IllegalStateException: The specified child already has a parent问题解决办法
- Lasso and Elastic Net for Sparse Signals:线性模型之套索和弹性网稀疏信号对比
- 套接字Socket
- 结构体和联合体
- 三种方式清除浮动