CodeforcesRound#258(Div.2)B.SorttheArray_html/css

time limit per test

memory limit per test

input

output

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.

Input

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).

Output

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.

Sample test(s)

Input

33 2 1

Output

yes1 3

Input

42 1 3 4

Output

yes1 2

Input

43 1 2 4

Output

no

Input

21 2

Output

yes1 1

Note

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].

醉了，寫了半天不對，原來又是把題目看錯(cuò)了。翻轉(zhuǎn)序列中某一段能否使得序列遞增

#include #include #include #include #include #include #define ll __int64ll a[100009];ll b[100009];using namespace std;int main(){ int n; while(~scanf("%d",&n)) { memset(a,0,sizeof a); for(int i=1;i<=n;i++) { scanf("%I64d",&a[i]); b[i]=a[i]; } sort(b+1,b+1+n); int st=1,en=1; for(int i=1;i<=n;i++) { if(a[i]!=b[i]) { st=i; break; } } for(int i=n;i>=1;i--) { if(a[i]!=b[i]) { en=i; break; } } for(int i=0;i<(en-st+1)/2;i++) { swap(a[en-i],a[st+i]); } int f=0; for(int i=1;i<=en;i++) { if(a[i]!=b[i]) { f=1; break; } } if(f) cout<<"no"<

聲明：本網(wǎng)頁內(nèi)容旨在傳播知識，若有侵權(quán)等問題請及時(shí)與本網(wǎng)聯(lián)系，我們將在第一時(shí)間刪除處理。TEL:177 7030 7066 E-MAIL:11247931@qq.com