|
| 1 | +'use strict'; |
| 2 | + |
| 3 | +process.stdin.resume(); |
| 4 | +process.stdin.setEncoding('utf-8'); |
| 5 | + |
| 6 | +let inputString = ''; |
| 7 | +let currentLine = 0; |
| 8 | + |
| 9 | +process.stdin.on('data', inputStdin => { |
| 10 | + inputString += inputStdin; |
| 11 | +}); |
| 12 | + |
| 13 | +process.stdin.on('end', _ => { |
| 14 | + inputString = inputString.replace(/\s*$/, '') |
| 15 | + .split('\n') |
| 16 | + .map(str => str.replace(/\s*$/, '')); |
| 17 | + |
| 18 | + main(); |
| 19 | +}); |
| 20 | + |
| 21 | +function readLine() { |
| 22 | + return inputString[currentLine++]; |
| 23 | +} |
| 24 | + |
| 25 | +// Complete the almostSorted function below. |
| 26 | +function almostSorted(arr) { |
| 27 | + const isSorted = arr => arr.every((v, i, a) => !i || a[i - 1] <= v); |
| 28 | + const swap = (arr, i, j) => { |
| 29 | + let t = arr[i]; |
| 30 | + arr[i] = arr[j]; |
| 31 | + arr[j] = t; |
| 32 | + }; |
| 33 | + const reverse = (arr, i, j) => { |
| 34 | + let split = arr.slice(i, j + 1); |
| 35 | + split.reverse(); |
| 36 | + arr.splice(i, j, ...split); |
| 37 | + } |
| 38 | + |
| 39 | + let peak = [], valley = []; |
| 40 | + for (let i = 1; i < arr.length - 1; i++) { |
| 41 | + let prev = arr[i - 1], |
| 42 | + current = arr[i], |
| 43 | + next = arr[i + 1]; |
| 44 | + if (current > prev && current > next && next > prev) { |
| 45 | + // console.log("peak", i + 1, current) |
| 46 | + peak.push(i + 1) |
| 47 | + } |
| 48 | + else if (prev > current && current < next && next > prev) { |
| 49 | + // console.log("valley", i + 1, current) |
| 50 | + |
| 51 | + valley.push(i + 1) |
| 52 | + } |
| 53 | + } |
| 54 | + // console.log(valley, peak) |
| 55 | + if (arr.length === 2) { |
| 56 | + if (arr[0] > arr[1]) |
| 57 | + console.log(`yes\nswap 1 2`); |
| 58 | + } |
| 59 | + // case 2 |
| 60 | + else if (valley.length === 1 && peak.length === 1) { |
| 61 | + swap(arr, peak[0] - 1, valley[0] - 1); |
| 62 | + if (isSorted(arr)) { |
| 63 | + console.log(`yes\nswap ${peak[0]} ${valley[0]}`); |
| 64 | + return; |
| 65 | + } |
| 66 | + swap(arr, peak[0] - 1, valley[0] - 1); |
| 67 | + reverse(arr, peak[0] - 1, valley[0] - 1); |
| 68 | + // swap |
| 69 | + if (isSorted(arr)) { |
| 70 | + console.log(`yes\nreverse ${peak[0]} ${valley[0]}`); |
| 71 | + } else { |
| 72 | + console.log('no'); |
| 73 | + } |
| 74 | + } |
| 75 | + // case 1 |
| 76 | + else if (valley.length === 1) |
| 77 | + console.log("no"); |
| 78 | + // case 4 |
| 79 | + else if (valley.length === 0 && peak.length === 0) { |
| 80 | + reverse(arr, 0, arr.length - 1) |
| 81 | + if (isSorted(arr)) { |
| 82 | + console.log(`yes\nreverse 1 ${arr.length}`) |
| 83 | + } else { console.log('no') } |
| 84 | + } |
| 85 | + else { |
| 86 | + console.log("no"); |
| 87 | + } |
| 88 | +} |
| 89 | + |
| 90 | +function main() { |
| 91 | + const n = parseInt(readLine(), 10); |
| 92 | + |
| 93 | + const arr = readLine().split(' ').map(arrTemp => parseInt(arrTemp, 10)); |
| 94 | + |
| 95 | + almostSorted(arr); |
| 96 | +} |
0 commit comments