codeforces-scrape

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

978D.md (2710B)


      1 Source: https://codeforces.com/problemset/problem/978/D
      2 
      3 D. Almost Arithmetic Progression
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Polycarp likes arithmetic progressions. A sequence $[a_1, a_2, \dots, a_n]$ is called an arithmetic progression if for each $i$ ($1 \le i \lt n$) the value $a_{i+1} - a_i$ is the same. For example, the sequences $[42]$, $[5, 5, 5]$, $[2, 11, 20, 29]$ and $[3, 2, 1, 0]$ are arithmetic progressions, but $[1, 0, 1]$, $[1, 3, 9]$ and $[2, 3, 1]$ are not.
     22 
     23 It follows from the definition that any sequence of length one or two is an arithmetic progression.
     24 
     25 Polycarp found some sequence of positive integers $[b_1, b_2, \dots, b_n]$. He agrees to change each element by at most one. In the other words, for each element there are exactly three options: an element can be decreased by $1$, an element can be increased by $1$, an element can be left unchanged.
     26 
     27 Determine a minimum possible number of elements in $b$ which can be changed (by exactly one), so that the sequence $b$ becomes an arithmetic progression, or report that it is impossible.
     28 
     29 It is possible that the resulting sequence contains element equals $0$.
     30 
     31 Input
     32 
     33 The first line contains a single integer $n$ $(1 \le n \le 100\,000)$ — the number of elements in $b$.
     34 
     35 The second line contains a sequence $b_1, b_2, \dots, b_n$ $(1 \le b_i \le 10^{9})$.
     36 
     37 Output
     38 
     39 If it is impossible to make an arithmetic progression with described operations, print -1. In the other case, print non-negative integer — the minimum number of elements to change to make the given sequence becomes an arithmetic progression. The only allowed operation is to add/to subtract one from an element (can't use operation twice to the same position).
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 4  
     47 24 21 14 10
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 3
     54 ```
     55 
     56 Input
     57 
     58 ```
     59 2  
     60 500 500
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 0
     67 ```
     68 
     69 Input
     70 
     71 ```
     72 3  
     73 14 5 1
     74 ```
     75 
     76 Output
     77 
     78 ```
     79 -1
     80 ```
     81 
     82 Input
     83 
     84 ```
     85 5  
     86 1 3 6 9 12
     87 ```
     88 
     89 Output
     90 
     91 ```
     92 1
     93 ```
     94 
     95 Note
     96 
     97 In the first example Polycarp should increase the first number on $1$, decrease the second number on $1$, increase the third number on $1$, and the fourth number should left unchanged. So, after Polycarp changed three elements by one, his sequence became equals to $[25, 20, 15, 10]$, which is an arithmetic progression.
     98 
     99 In the second example Polycarp should not change anything, because his sequence is an arithmetic progression.
    100 
    101 In the third example it is impossible to make an arithmetic progression.
    102 
    103 In the fourth example Polycarp should change only the first element, he should decrease it on one. After that his sequence will looks like $[0, 3, 6, 9, 12]$, which is an arithmetic progression.