codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

56B.md (1965B)


      1 Source: https://codeforces.com/problemset/problem/56/B
      2 
      3 B. Spoilt Permutation
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Vasya collects coins: he has exactly one coin for every year from 1 to *n*. Naturally, Vasya keeps all the coins in his collection in the order in which they were released. Once Vasya's younger brother made a change — he took all the coins whose release year dated from *l* to *r* inclusively and put them in the reverse order. That is, he took a certain segment [*l*, *r*] and reversed it. At that the segment's endpoints did not coincide. For example, if *n* = 8, then initially Vasya's coins were kept in the order 1 2 3 4 5 6 7 8. If Vasya's younger brother chose the segment [2, 6], then after the reversal the coin order will change to 1 6 5 4 3 2 7 8. Vasya suspects that someone else could have spoilt the permutation after his brother. Help him to find that out. Check if the given permutation can be obtained from the permutation 1 2 ... *n* using exactly one segment reversal. If it is possible, find the segment itself.
     22 
     23 Input
     24 
     25 The first line contains an integer *n* (1 ≤ *n* ≤ 1000) which is the number of coins in Vasya's collection. The second line contains space-separated *n* integers which are the spoilt sequence of coins. It is guaranteed that the given sequence is a permutation, i.e. it contains only integers from 1 to *n*, and every number is used exactly 1 time.
     26 
     27 Output
     28 
     29 If it is impossible to obtain the given permutation from the original one in exactly one action, print 0 0. Otherwise, print two numbers *l* *r* (1 ≤ *l* < *r* ≤ *n*) which are the endpoints of the segment that needs to be reversed to obtain from permutation 1 2 ... *n* the given one.
     30 
     31 Examples
     32 
     33 Input
     34 
     35 ```
     36 8  
     37 1 6 5 4 3 2 7 8
     38 ```
     39 
     40 Output
     41 
     42 ```
     43 2 6
     44 ```
     45 
     46 Input
     47 
     48 ```
     49 4  
     50 2 3 4 1
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 0 0
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 4  
     63 1 2 3 4
     64 ```
     65 
     66 Output
     67 
     68 ```
     69 0 0
     70 ```