codeforces-scrape

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

1062A.md (2163B)


      1 Source: https://codeforces.com/problemset/problem/1062/A
      2 
      3 A. A Prank
      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 JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array $a_1$, $a_2$, ..., $a_n$ of integers, such that $1 \le a_1 \lt a_2 \lt \ldots \lt a_n \le 10^3$, and then went to the bathroom.
     22 
     23 JATC decided to prank his friend by erasing some consecutive elements in the array. Since he doesn't want for the prank to go too far, he will only erase in a way, such that Giraffe can still restore the array using the information from the remaining elements. Because Giraffe has created the array, he's also aware that it's an increasing array and all the elements are integers in the range $[1, 10^3]$.
     24 
     25 JATC wonders what is the greatest number of elements he can erase?
     26 
     27 Input
     28 
     29 The first line of the input contains a single integer $n$ ($1 \le n \le 100$) — the number of elements in the array.
     30 
     31 The second line of the input contains $n$ integers $a_i$ ($1 \le a_1 \lt a_2 \lt \dots \lt a_n \le 10^3$) — the array written by Giraffe.
     32 
     33 Output
     34 
     35 Print a single integer — the maximum number of consecutive elements in the array that JATC can erase.
     36 
     37 If it is impossible to erase even a single element, print $0$.
     38 
     39 Examples
     40 
     41 Input
     42 
     43 ```
     44 6  
     45 1 3 4 5 6 9
     46 ```
     47 
     48 Output
     49 
     50 ```
     51 2
     52 ```
     53 
     54 Input
     55 
     56 ```
     57 3  
     58 998 999 1000
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 2
     65 ```
     66 
     67 Input
     68 
     69 ```
     70 5  
     71 1 2 3 4 5
     72 ```
     73 
     74 Output
     75 
     76 ```
     77 4
     78 ```
     79 
     80 Note
     81 
     82 In the first example, JATC can erase the third and fourth elements, leaving the array $[1, 3, \_, \_, 6, 9]$. As you can see, there is only one way to fill in the blanks.
     83 
     84 In the second example, JATC can erase the second and the third elements. The array will become $[998, \_, \_]$. Because all the elements are less than or equal to $1000$, the array is still can be restored. Note, that he can't erase the first $2$ elements.
     85 
     86 In the third example, JATC can erase the first $4$ elements. Since all the elements are greater than or equal to $1$, Giraffe can still restore the array. Note, that he can't erase the last $4$ elements.