Problems > Reverse One Segment

Reverse One Segment

Difficulty: 1400 3000 ms 128 MB

implementation sorting

Can the list be made non-decreasing by reversing exactly one contiguous segment (possibly of length 1)?

Input: the first line has N; the second line has N integers.

Output: YES or NO.

Constraints:

  • 1 ≤ N ≤ 105
  • −109 ≤ ai ≤ 109

Sample Tests

Input 1
5
1 5 4 3 6
Output 1
YES
Input 2
4
2 1 4 3
Output 2
NO

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.